Termination of rewriting strategies: a generic approach

Details Termination of rewriting strategies: a generic approach Termination of rewriting strategies: a generic approach

2005-07-26

arxiv.org/abs/cs/0507064v1

Computer Science

Logic in Computer Science

49 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Termination of rewriting strategies: a generic approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Termination of rewriting strategies: a generic approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Termination of rewriting strategies: a generic approach will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-494722