Polynomial Interpretations for Higher-Order Rewriting

Details Polynomial Interpretations for Higher-Order Rewriting Polynomial Interpretations for Higher-Order Rewriting

2012-03-26

arxiv.org/abs/1203.5754v1

Computer Science

Logic in Computer Science

Scientific paper

The termination method of weakly monotonic algebras, which has been defined for higher-order rewriting in the HRS formalism, offers a lot of power, but has seen little use in recent years. We adapt and extend this method to the alternative formalism of algebraic functional systems, where the simply-typed lambda-calculus is combined with algebraic reduction. Using this theory, we define higher-order polynomial interpretations, and show how the implementation challenges of this technique can be tackled. A full implementation is provided in the termination tool WANDA.

Affiliated with

Also associated with

No associations

Rating

Polynomial Interpretations for Higher-Order Rewriting 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 Polynomial Interpretations for Higher-Order Rewriting, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polynomial Interpretations for Higher-Order Rewriting will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-642625