Skip to Main content Skip to Navigation

Termination of rewriting strategies: a generic approach

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 : 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 modeled 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. Abstraction constraints can be used to control The narrowing mechanism, well known to easily diverge. The generic method is then instantiated for the innermost, outermost and local strategies.
Complete list of metadata
Contributor : Helene Kirchner Connect in order to contact the contributor
Submitted on : Friday, July 21, 2006 - 4:59:52 PM
Last modification on : Friday, February 26, 2021 - 3:28:06 PM


  • HAL Id : inria-00000178, version 1



Isabelle Gnaedig, Hélène Kirchner. Termination of rewriting strategies: a generic approach. [Research Report] 2005, pp.49. ⟨inria-00000178⟩



Les métriques sont temporairement indisponibles