Unification in Matching Logic -- Revisited
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866929570077212672 |
|---|---|
| author | Kurucz, Ádám Bereczky, Péter Horpácsi, Dániel |
| author_facet | Kurucz, Ádám Bereczky, Péter Horpácsi, Dániel |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_23760 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Unification in Matching Logic -- Revisited Kurucz, Ádám Bereczky, Péter Horpácsi, Dániel Logic in Computer Science 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. |
| title | Unification in Matching Logic -- Revisited |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2410.23760 |