Automatically proving termination where simplification orderings fail
- 1 January 1997
- book chapter
- Published by Springer Nature
- p. 261-272
- https://doi.org/10.1007/bfb0030602
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Proving innermost normalisation automaticallyPublished by Springer Nature ,1997
- Modular proofs for completeness of hierarchical term rewriting systemsTheoretical Computer Science, 1995
- Natural terminationTheoretical Computer Science, 1995
- Generating polynomial orderingsInformation Processing Letters, 1994
- Termination of term rewriting: interpretation and type eliminationJournal of Symbolic Computation, 1994
- Termination by completionApplicable Algebra in Engineering, Communication and Computing, 1990
- Rewrite SystemsPublished by Elsevier ,1990
- Termination of rewriting systems by polynomial interpretations and its implementationScience of Computer Programming, 1987
- Counterexamples to termination for the direct sum of term rewriting systemsInformation Processing Letters, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987