Complete sets of unifiers and matchers in equational theories
- 1 January 1986
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 43, 189-200
- https://doi.org/10.1016/0304-3975(86)90175-1
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Properties of substitutions and unificationsJournal of Symbolic Computation, 1985
- An Efficient Unification AlgorithmACM Transactions on Programming Languages and Systems, 1982
- The undecidability of the second-order unification problemTheoretical Computer Science, 1981
- The undecidability of the third order dyadic unification problemInformation and Control, 1978
- An algorithm to generate the basis of solutions to homogeneous linear diophantine equationsInformation Processing Letters, 1978
- Linear unificationJournal of Computer and System Sciences, 1978
- Mechanizing ω-order type theory through unificationTheoretical Computer Science, 1976
- A unification algorithm for typed -calculusTheoretical Computer Science, 1975
- The undecidability of unification in third order logicInformation and Control, 1973
- Hilbert's Tenth Problem is UnsolvableThe American Mathematical Monthly, 1973