Induction for termination with local strategies

Olivier Fissore 1 Isabelle Gnaedig 1 Hélène Kirchner 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper, we propose a method for specifically proving termination of rewriting with particular strategies: local strategies on operators. An inductive proof procedure is proposed, based on an explicit induction on the termination property. Given a term, the proof principle relies on alternatively applying the induction hypothesis on its subterms, by abstracting the subterms with induction variables, and narrowing the obtained terms in one step, according to the strategy. The induction relation, an F-stable ordering having the subterm property, is not given a priori, but its existence is checked along the proof, by testing satisfiability of ordering constraints.
Type de document :
Article dans une revue
Electronic Notes in Theoretical Computer Science, Elsevier, 2001, 58 (2), 34 p
Liste complète des métadonnées
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 14:43:20
Dernière modification le : jeudi 11 janvier 2018 - 06:19:57


  • HAL Id : inria-00100418, version 1



Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. Induction for termination with local strategies. Electronic Notes in Theoretical Computer Science, Elsevier, 2001, 58 (2), 34 p. 〈inria-00100418〉



Consultations de la notice