Decidability of the confluence of finite ground term rewrite systems and of other related term rewrite systems
- 1 October 1990
- journal article
- Published by Elsevier in Information and Computation
- Vol. 88 (2) , 187-201
- https://doi.org/10.1016/0890-5401(90)90015-a
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The Church-Rosser property for ground term-rewriting systems is decidableTheoretical Computer Science, 1987
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980
- Fast Decision Procedures Based on Congruence ClosureJournal of the ACM, 1980