Termination Proofs by Context-Dependent Interpretations
Author:
- 8 May 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 108-121
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Term Rewriting and All That1998
- Generating polynomial orderings for termination proofs1995
- Termination of rewrite systems by elementary interpretationsFormal Aspects of Computing, 1995
- Termination proofs by multiset path orderings imply primitive recursive derivation lengthsTheoretical Computer Science, 1992
- Polynomial interpretations and the complexity of algorithmsLecture Notes in Computer Science, 1992
- Incremental termination proofs and the length of derivations1991
- Rewrite Systems1990
- Termination proofs and the length of derivationsLecture Notes in Computer Science, 1989
- Termination of rewriting systems by polynomial interpretations and its implementationScience of Computer Programming, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987