Induction for Termination

Abstract

Rapport interne.We propose a new approach to prove termination of innermost rewriting, based on induction, abstraction and narrowing. The induction ordering is not explicitly given a priori, but its existence is checked along the proof, by testing satisfiability of ordering constraints. A rule-based description of the technique is given, as well as a few examples to illustrate the method