Modular termination of term rewriting systems revisited
Authors:
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 255-272
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Hierarchical termination1995
- Modularity of simple termination of term rewriting systems with shared constructorsTheoretical Computer Science, 1992
- Completeness of combinations of constructor systemsLecture Notes in Computer Science, 1991
- Rewrite Systems1990
- 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