Proving weak termination also provides the right way to terminate - Extended version - - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2004

Proving weak termination also provides the right way to terminate - Extended version -

Abstract

We give an inductive method for proving weak innermost termination of rule-based programs, from which we automatically infer, for each successful proof, a finite strategy for data evaluation. We first present the proof principle, using an explicit induction on the termination property, to prove that any input data has at least one finite evaluation. For that, we observe proof trees built from the rewrite system, schematizing the innermost rewriting tree of any ground term, and generated with two mechanisms: abstraction, schematizing normalization of subterms, and narrowing, schematizing rewriting steps. Then, we show how, for any ground term, a normalizing rewriting strategy can be extracted from the proof trees, even if the ground term admits infinite rewriting derivations.
Fichier principal
Vignette du fichier
A04-R-522.pdf (375.84 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00099872 , version 1 (19-06-2009)

Identifiers

  • HAL Id : inria-00099872 , version 1

Cite

Olivier Fissore, Isabelle Gnaedig, Hélène Kirchner. Proving weak termination also provides the right way to terminate - Extended version -. [Intern report] A04-R-522 || fissore04b, 2004, 54 p. ⟨inria-00099872⟩
190 View
58 Download

Share

Gmail Facebook X LinkedIn More