Order-sorted equational unification

Abstract : 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.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00075605
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 6:35:18 PM
Last modification on : Saturday, September 17, 2016 - 1:06:52 AM
Long-term archiving on : Friday, May 13, 2011 - 1:31:17 PM

Identifiers

  • HAL Id : inria-00075605, version 1

Collections

Citation

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

Share

Metrics

Record views

211

Files downloads

65