Relating innermost, weak, uniform and modular termination of term rewriting systems
- 23 November 2005
- book chapter
- Published by Springer Nature
- p. 285-296
- https://doi.org/10.1007/bfb0013069
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A sufficient condition for the termination of the direct sum of term rewriting systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Completeness of combinations of constructor systemsPublished by Springer Nature ,1991
- Termination for the direct sum of left-linear term rewriting systemsPublished by Springer Nature ,1989
- On termination of the direct sum of term-rewriting systemsInformation Processing Letters, 1987
- Counterexamples to termination for the direct sum of term rewriting systemsInformation Processing Letters, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- On the Church-Rosser property for the direct sum of term rewriting systemsJournal of the ACM, 1987
- Equational logic as a programming language: AbstractLecture Notes in Computer Science, 1985
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Tree-Manipulating Systems and Church-Rosser TheoremsJournal of the ACM, 1973