Unification in Matching Logic — Revisited
Open Access
- 31 October 2024
- journal article
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 410, 1-17
Abstract
Matching logic is a logical framework for specifying and reasoning about programs using pattern matching semantics. A pattern is made up of a number of structural components and constraints. Structural components are syntactically matched, while constraints need to be satisfied. Having multiple structural patterns poses a practical problem as it requires multiple matching operations. This is easily remedied by unification, for which an algorithm has already been defined and proven correct in a sorted, polyadic variant of matching logic. This paper revisits the subject in the applicative variant of the language while generalising the unification problem and mechanizing a proven-sound solution in Coq.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Interactive Matching Logic Proofs in Coq2023
- Mechanizing Matching Logic In CoqElectronic Proceedings in Theoretical Computer Science, 2022
- Towards a Trustworthy Semantics-Based Language Framework via Proof Generation2021
- Matching logic explainedJournal of Logical and Algebraic Methods in Programming, 2021
- Unification in Matching Logic2019
- Matching μ-Logic2019
- Matching LogicLogical Methods in Computer Science, 2017
- The Locally Nameless RepresentationJournal of Automated Reasoning, 2011
- Unification Theory2001