Subject
General Computer Science,Theoretical Computer Science
Reference37 articles.
1. Conditional rewrite rules: confluence and termination;Bergstra;JCSS,1986
2. Diagram techniques for confluence;Bezem;Inform. and Comput.,1998
3. An extension of Klop's counterexample to the Church–Rosser property to lambda-calculus with other ordered pair combinators;Bunder;Theoret. Comput. Sci.,1985
4. P. Chew, Normal forms in term rewriting systems, Ph.D. Thesis, Purdue University, Indiana, 1981.
5. P. Chew, Unique normal forms in term rewriting systems with repeated variables, Proc. 13th ACM STOC, 1981, pp. 7–18.