Hierarchical termination
Author:
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 89-105
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Natural terminationTheoretical Computer Science, 1995
- Generalized sufficient conditions for modular termination of rewritingApplicable Algebra in Engineering, Communication and Computing, 1994
- Logic Programming and Automated Reasoning1993
- Modular term rewriting systems and the terminationInformation Processing Letters, 1990
- On termination of the direct sum of term-rewriting systemsInformation Processing Letters, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Operational and Semantic Equivalence Between Recursive ProgramsJournal of the ACM, 1980
- Proving termination with multiset orderingsCommunications of the ACM, 1979