A combinatory logic approach to higher-order E-unification
- 6 March 1995
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 139 (1-2) , 207-242
- https://doi.org/10.1016/0304-3975(94)00210-a
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Normal Forms in Combinatory LogicNotre Dame Journal of Formal Logic, 1994
- Complete sets of transformations for general E-unificationTheoretical Computer Science, 1989
- Higher-order unification revisited: Complete sets of transformationsJournal of Symbolic Computation, 1989
- Unification in a combination of arbitrary disjoint equational theoriesJournal of Symbolic Computation, 1989
- Termination of rewritingJournal of Symbolic Computation, 1987
- Conditional rewrite rules: Confluence and terminationJournal of Computer and System Sciences, 1986
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- The decidability of hindley's axioms for strong reductionThe Journal of Symbolic Logic, 1967
- Axioms for strong reduction in combinatory logicThe Journal of Symbolic Logic, 1967
- Strong reduction and normal form in combinatory logicThe Journal of Symbolic Logic, 1967