Order-sorted equational unification - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1988

Order-sorted equational unification

Claude Kirchner


Order-sorted equational unification is studied from an algebraic point of view. We show how order-sorted equational unification algorithms can be built when the order-sorted signature is regular (i.e. every term has a unique least sort) and the equational specification is sort-preserving (i.e. any A-equal terms have the same least sort). Under these conditions the transformations rules allowing to build unification algorithms in the unsorted framework can be extended to the order-sorted one. This allows us to generalize the known results to order-sorted equational unification, in particular when there exist overloaded symbols with different properties. An important application is order-sorted associative-commutative unification for which no direct algorithm was given until now.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-0954.pdf (896.53 Ko) Télécharger le fichier

Dates and versions

inria-00075605 , version 1 (24-05-2006)


  • HAL Id : inria-00075605 , version 1


Claude Kirchner. Order-sorted equational unification. [Research Report] RR-0954, INRIA. 1988. ⟨inria-00075605⟩
95 View
48 Download


Gmail Facebook Twitter LinkedIn More