Argument filterings and usable rules in higher-order rewrite systems

Details Argument filterings and usable rules in higher-order rewrite systems Argument filterings and usable rules in higher-order rewrite systems

2011-09-20

arxiv.org/abs/1109.4357v1

IPSJ Transactions on Programming 4, 2 (2011) 1-12

Computer Science

Logic in Computer Science

Scientific paper

The static dependency pair method is a method for proving the termination of higher-order rewrite systems a la Nipkow. It combines the dependency pair method introduced for first-order rewrite systems with the notion of strong computability introduced for typed lambda-calculi. Argument filterings and usable rules are two important methods of the dependency pair framework used by current state-of-the-art first-order automated termination provers. In this paper, we extend the class of higher-order systems on which the static dependency pair method can be applied. Then, we extend argument filterings and usable rules to higher-order rewriting, hence providing the basis for a powerful automated termination prover for higher-order rewrite systems.

Affiliated with

Also associated with

No associations

Rating

Argument filterings and usable rules in higher-order rewrite systems 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 Argument filterings and usable rules in higher-order rewrite systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Argument filterings and usable rules in higher-order rewrite systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-147746