Regular paperA combinatory logic approach to higher-order E-unification☆
Review articleOpen access
1995/03/06 Full-length article DOI: 10.1016/0304-3975(94)00210-A
Journal: Theoretical Computer Science
AbstractLet E be a first-order equational theory. A translation of higher-order E-unification problems into a combinatory logic framework is presented and justified. The case in which E admits presentation as a convergent term rewriting system is treated in detail: in this situation, a modification of ordinary narrowing is shown to be a complete method for enumerating higher-order E-unifiers. In fact, we treat a more general problem, in which the types of terms contain type variables.
Request full text