Unification of Higher-order Patterns modulo Simple Syntactic Equational Theories - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2000

Unification of Higher-order Patterns modulo Simple Syntactic Equational Theories

Abstract

We present an algorithm for unification of higher-order patterns modulo simple syntactic equational theories as defined by Kirchner [14]. The algorithm by Miller [17] for pattern unification, refined by Nipkow [18] is first modified in order to behave as a first-order unification algorithm. Then the mutation rule for syntactic theories of Kirchner [13,14] is adapted to pattern E-unification. If the syntactic algorithm for a theory E terminates in the first-order case, then our algorithm will also terminate for pattern E-unification. The result is a DAG-solved form plus some equations of the form λ øverlinex.F(øverlinex) = λ øverlinex. F(øverlinex^π ) where øverlinex^π is a permutation of øverlinex When all function symbols are decomposable these latter equations can be discarded, otherwise the compatibility of such equations with the solved form remains open.
Fichier principal
Vignette du fichier
dm040102.pdf (182.49 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00958942 , version 1 (13-03-2014)

Identifiers

Cite

Alexandre Boudet. Unification of Higher-order Patterns modulo Simple Syntactic Equational Theories. Discrete Mathematics and Theoretical Computer Science, 2000, Vol. 4 no. 1 (1), pp.11-30. ⟨10.46298/dmtcs.270⟩. ⟨hal-00958942⟩
75 View
628 Download

Altmetric

Share

Gmail Facebook X LinkedIn More