Generalizing Newman’s Lemma for Left-Linear Rewrite Systems
Authors:
- 1 January 2006
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 66-80
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Polynomials over the reals in proofs of termination : from theory to practiceRAIRO - Theoretical Informatics and Applications, 2005
- Transformation techniques for context-sensitive rewrite systemsJournal of Functional Programming, 2004
- Context-Sensitive Rewriting StrategiesInformation and Computation, 2002
- Developing developmentsTheoretical Computer Science, 1997
- Modularity of confluence: A simplified proofInformation Processing Letters, 1994
- On the Church-Rosser property for the direct sum of term rewriting systemsJournal of the ACM, 1987
- Operational and Semantic Equivalence Between Recursive ProgramsJournal of the ACM, 1980
- An abstract Church-Rosser theorem. II: ApplicationsThe Journal of Symbolic Logic, 1974
- Tree-Manipulating Systems and Church-Rosser TheoremsJournal of the ACM, 1973
- On Theories with a Combinatorial Definition of "Equivalence"Annals of Mathematics, 1942