Skip to Main content Skip to Navigation
Conference papers

Termination of rewriting strategies: a generic approach

Isabelle Gnaedig 1, 2 Hélène Kirchner 1, 2
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 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/inria-00172897
Contributor : Isabelle Gnaedig <>
Submitted on : Tuesday, September 18, 2007 - 12:45:33 PM
Last modification on : Monday, September 17, 2018 - 1:42:01 PM
Long-term archiving on: : Friday, April 9, 2010 - 2:22:12 AM

File

appsem.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00172897, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

242

Files downloads

106