  Building on our previous work on hybrid polyadic modal logic we identify
modal logic equivalents for Matching Logic, a logic for program specification
and verification. This provides a rigorous way to transfer results between the
two approaches, which should benefit both systems.
