Skip to Main content Skip to Navigation
New interface
Journal articles

Termination of Rewriting under Strategies

Isabelle Gnaedig 1 Hélène Kirchner 2 
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 PAREO - Formal islands: foundations and applications
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : A termination proof method for rewriting under strategies, based on an explicit induction on the termination property, is presented and instantiated for the innermost, outermost and local strategies. Rewriting trees are simulated by proof trees generated with an abstraction mechanism, narrowing and constraints representing sets of ground terms. Abstraction introduce variables to represent normal forms without computing them and to control the narrowing mechanism, well-known to easily diverge. The induction ordering is not given a priori, but defined with ordering constraints, incrementally set during the proof. It is established that termination under strategy is equivalent to the construction of finite proof trees schematizing terminating rewriting trees. Sufficient effective conditions to ensure finiteness are studied and the method is illustrated on several examples for each specific strategy.
Document type :
Journal articles
Complete list of metadata

Cited literature [71 references]  Display  Hide  Download
Contributor : Isabelle Gnaedig Connect in order to contact the contributor
Submitted on : Friday, September 14, 2018 - 2:00:19 PM
Last modification on : Saturday, June 25, 2022 - 7:41:45 PM
Long-term archiving on: : Saturday, December 15, 2018 - 3:35:05 PM


Files produced by the author(s)




Isabelle Gnaedig, Hélène Kirchner. Termination of Rewriting under Strategies. ACM Transactions on Computational Logic, 2009, 10 (2), pp.1-52. ⟨10.1145/1462179.1462182⟩. ⟨inria-00182432⟩



Record views


Files downloads