Termination of rewriting under strategies: a generic approach - Archive ouverte HAL Access content directly
Reports (Research Report) ACM Transactions on Computational Logic Year : 2006

Termination of rewriting under strategies: a generic approach

(1) , (1)
1

Abstract

We propose a synthesis of three induction based algorithms, we already have given to prove termination of rewrite rule based programs, respectively for the innermost, the outermost and the local strategies. A generic inference principle is presented, based on an explicit induction on the termination property, which genetates ordering constraints, defining the induction relation. The generic inference principle is then instantiated to provide proof procedures for the three specific considered strategies.
Fichier principal
Vignette du fichier
tocl-second-version-hal.pdf (526.92 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00113156 , version 1 (10-11-2006)

Identifiers

  • HAL Id : inria-00113156 , version 1

Cite

Isabelle Gnaedig, Hélène Kirchner. Termination of rewriting under strategies: a generic approach. [Research Report] 2006. ⟨inria-00113156⟩
109 View
94 Download

Share

Gmail Facebook Twitter LinkedIn More