A class of confluent term rewriting systems and unification
- 1 December 1986
- journal article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 2 (4) , 391-418
- https://doi.org/10.1007/bf00248250
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Equational logic programmingPublished by Association for Computing Machinery (ACM) ,1986
- Unification in conditional-equational theoriesPublished by Springer Nature ,1985
- Equality, types, modules, and (why not?) generics for logic programmingThe Journal of Logic Programming, 1984
- Universal UnificationPublished by Springer Nature ,1984
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981
- Canonical Forms and Unification.Published by Defense Technical Information Center (DTIC) ,1980
- Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research.Published by Elsevier ,1970
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965