%0 Report
%T Termination of rewriting strategies: a generic approach
%+ Constraints, automatic deduction and software properties proofs (PROTHEO)
%A Gnaedig, Isabelle
%A Kirchner, Hélène
%P 49
%8 2005
%D 2005
%K termination proof
%K rewrite system
%K rewriting strategy
%K induction
%K narrowing
%K abstraction
%K innermost strategy
%K outermost strategy
%K local strategy
%Z Computer Science [cs]/Logic in Computer Science [cs.LO]
%Z Computer Science [cs]/Programming Languages [cs.PL]Reports
%X 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.
%G English
%L inria-00000178
%U https://inria.hal.science/inria-00000178
%~ CNRS
%~ INRIA
%~ INPL
%~ IRISA
%~ INRIA-LORRAINE
%~ LORIA2
%~ INRIA-NANCY-GRAND-EST
%~ TESTALAIN1
%~ UNIV-LORRAINE
%~ INRIA2
%~ LORIA
%~ LARA
%~ UR1-MATH-STIC
%~ UR1-UFR-ISTIC
%~ INRIA-300009
%~ UR1-MATH-NUM