Termination analysis for functional programs using term orderings

This publication has 19 references indexed in Scilit:

• Generating polynomial orderings for termination proofs
  Published by Springer Nature ,1995
• Proving termination of (conditional) rewrite systems
  Acta Informatica, 1993
• Topics in termination
  Published by Springer Nature ,1993
• Termination by completion
  Applicable Algebra in Engineering, Communication and Computing, 1990
• The OYSTER-CLAM system
  Published by Springer Nature ,1990
• Termination of rewriting systems by polynomial interpretations and its implementation
  Science of Computer Programming, 1987
• Termination of rewriting
  Journal of Symbolic Computation, 1987
• The karlsruhe induction theorem proving system
  Published by Springer Nature ,1986
• A procedure for automatically proving the termination of a set of rewrite rules
  Lecture Notes in Computer Science, 1985
• A note on simplification orderings
  Information Processing Letters, 1979