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.
Type de document :
Rapport
[Research Report] RR-0954, INRIA. 1988
Liste complète des métadonnées

https://hal.inria.fr/inria-00075605
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 18:35:18
Dernière modification le : samedi 17 septembre 2016 - 01:06:52
Document(s) archivé(s) le : vendredi 13 mai 2011 - 13:31:17

Fichiers

Identifiants

  • HAL Id : inria-00075605, version 1

Collections

Citation

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

Partager

Métriques

Consultations de la notice

200

Téléchargements de fichiers

53