The Church-Rosser property for ground term-rewriting systems is decidable
- 31 December 1987
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 49 (1) , 43-79
- https://doi.org/10.1016/0304-3975(87)90100-9
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- On Proving Uniform Termination and Restricted Termination of Rewriting SystemsSIAM Journal on Computing, 1983
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Fast Decision Procedures Based on Congruence ClosureJournal of the ACM, 1980
- Tree-Manipulating Systems and Church-Rosser TheoremsJournal of the ACM, 1973