Modular termination of term rewriting systems revisited
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 255-272
- https://doi.org/10.1007/bfb0014432
Abstract
No abstract availableKeywords
This publication has 14 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
- Modularity of simple termination of term rewriting systems with shared constructorsTheoretical Computer Science, 1992
- Completeness of combinations of constructor systemsPublished by Springer Nature ,1991
- Rewrite SystemsPublished by Elsevier ,1990
- 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
- On the Church-Rosser property for the direct sum of term rewriting systemsJournal of the ACM, 1987
- Completion of a Set of Rules Modulo a Set of EquationsSIAM Journal on Computing, 1986
- Conditional rewrite rulesTheoretical Computer Science, 1984
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982