Generalized sufficient conditions for modular termination of rewriting
- 1 May 1994
- journal article
- research article
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 5 (3-4) , 131-158
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- 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
- Modular term rewriting systems and the terminationInformation Processing Letters, 1990
- 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
- Termination of rewritingJournal of Symbolic Computation, 1987
- On the Church-Rosser property for the direct sum of term rewriting systemsJournal of the ACM, 1987
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- A note on simplification orderingsInformation Processing Letters, 1979