Termination of rewriting strategies: a generic approach - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2005

Termination of rewriting strategies: a generic approach


We propose a generic termination proof method for rewriting under strategies, based on an explicit induction on the termination property. Rewriting trees on ground terms are modelized by proof trees, generated by alternatively applying narrowing and abstracting steps. The induction principle is applied through the abstraction mechanism, where terms are replaced by variables representing any of their normal forms. The induction ordering is not given a priori, but defined with ordering constraints, incrementally set during the proof. The generic method is then instantiated for the innermost strategy, as an example.
Fichier principal
Vignette du fichier
appsem.pdf (242.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00172897 , version 1 (18-09-2007)


  • HAL Id : inria-00172897 , version 1


Isabelle Gnaedig, Hélène Kirchner. Termination of rewriting strategies: a generic approach. Proceedings of the third Workshop on Applied Semantics APPSEM'05, APPSEM II & Ludwig Maximilians Universität München, Sep 2005, Chiemsee, Germany. ⟨inria-00172897⟩
81 View
69 Download


Gmail Facebook X LinkedIn More