Associative-Commutative Unification
- 1 January 1984
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- The undecidability of the second-order unification problemTheoretical Computer Science, 1981
- A Unification Algorithm for Associative-Commutative FunctionsJournal of the ACM, 1981
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981
- A short survey on the state of the art in matching and unification problemsACM SIGSAM Bulletin, 1979
- An algorithm to generate the basis of solutions to homogeneous linear diophantine equationsInformation Processing Letters, 1978
- THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUPMathematics of the USSR-Sbornik, 1977
- Mechanizing ω-order type theory through unificationTheoretical Computer Science, 1976
- Hilbert's Tenth Problem is UnsolvableThe American Mathematical Monthly, 1973
- GEDANKEN—a simple typeless language based on the principle of completeness and the reference conceptCommunications of the ACM, 1970
- The next 700 programming languagesCommunications of the ACM, 1966