Incremental construction of unification algorithms in equational theories
- 25 January 2006
- book chapter
- Published by Springer Nature
- p. 361-373
- https://doi.org/10.1007/bfb0036921
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Confluent and coherent equational term rewriting systems application to proofs in abstract data typesLecture Notes in Computer Science, 1983
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- A Unification Algorithm for Associative-Commutative FunctionsJournal of the ACM, 1981
- Complete Sets of Reductions for Some Equational TheoriesJournal of the ACM, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- 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