Termination analysis for functional programs using term orderings
Author:
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 154-171
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Generating polynomial orderings for termination proofs1995
- Proving termination of (conditional) rewrite systemsActa Informatica, 1993
- Topics in termination1993
- Termination by completionApplicable Algebra in Engineering, Communication and Computing, 1990
- The OYSTER-CLAM system1990
- Termination of rewriting systems by polynomial interpretations and its implementationScience of Computer Programming, 1987
- Termination of rewritingJournal of Symbolic Computation, 1987
- The karlsruhe induction theorem proving system1986
- A procedure for automatically proving the termination of a set of rewrite rules1985
- A note on simplification orderingsInformation Processing Letters, 1979