Induction for termination with local strategies - Extended version - - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2001

Induction for termination with local strategies - Extended version -

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.
Fichier principal
Vignette du fichier
A01-R-177.pdf (342.16 Ko) Télécharger le fichier

Dates and versions

inria-00107541 , version 1 (19-10-2006)

Identifiers

  • HAL Id : inria-00107541 , version 1

Cite

Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. Induction for termination with local strategies - Extended version -. [Intern report] A01-R-177 || fissore01b, 2001, 29 p. ⟨inria-00107541⟩
82 View
42 Download

Share

Gmail Facebook X LinkedIn More