Static Dependency Pair Method based on Strong Computability for Higher-Order Rewrite Systems

Details Static Dependency Pair Method based on Strong Computability for Higher-Order Rewrite Systems Static Dependency Pair Method based on Strong Computability for Higher-Order Rewrite Systems

2011-09-26

arxiv.org/abs/1109.5468v1

Computer Science

Logic in Computer Science

IEICE Transactions on Information and Systems (2009)

Scientific paper

Higher-order rewrite systems (HRSs) and simply-typed term rewriting systems (STRSs) are computational models of functional programs. We recently proposed an extremely powerful method, the static dependency pair method, which is based on the notion of strong computability, in order to prove termination in STRSs. In this paper, we extend the method to HRSs. Since HRSs include \lambda-abstraction but STRSs do not, we restructure the static dependency pair method to allow \lambda-abstraction, and show that the static dependency pair method also works well on HRSs without new restrictions.

Affiliated with

Also associated with

No associations

Rating

Static Dependency Pair Method based on Strong Computability for 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 Static Dependency Pair Method based on Strong Computability for Higher-Order Rewrite Systems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Static Dependency Pair Method based on Strong Computability for Higher-Order Rewrite Systems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-688376