Higher-Order Equational Unification via Explicit Substitutions (1996)
| Venue: | in Proceedings of the tenth UNIF Workshop |
| Citations: | 5 - 3 self |
BibTeX
@INPROCEEDINGS{Kirchner96higher-orderequational,
author = {Claude Kirchner and Christophe Ringeissen},
title = {Higher-Order Equational Unification via Explicit Substitutions},
booktitle = {in Proceedings of the tenth UNIF Workshop},
year = {1996},
pages = {61--75},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. We show how to reduce the unification problem modulo fij- conversion and a first-order equational theory E, into a first-order unification problem in a union of two non-disjoint equational theories including E and a calculus of explicit substitutions. A rule-based unification procedure in this combined theory is described and may be viewed as an extension of the one initially designed by G. Dowek, T. Hardin and C. Kirchner for performing unification of simply typed -terms in a first-order setting via the oe-calculus of explicit substitutions. Additional rules are used to deal with the interaction between E and oe. 1 Introduction Unification modulo an equational theory plays an important role in automated deduction and in logic programming systems. For example, Prolog[NM88] is based on higher-order unification, ie. unification modulo the fij-conversion. In order to design more expressive higher-order logic programming systems enhanced with a first-order equational theory E,...
