Refinement Types as Higher Order Dependency Pairs

Details Refinement Types as Higher Order Dependency Pairs Refinement Types as Higher Order Dependency Pairs

2011-01-05

arxiv.org/abs/1101.0968v2

Computer Science

Logic in Computer Science

Scientific paper

Refinement types are a well-studied manner of performing in-depth analysis on functional programs. The dependency pair method is a very powerful method used to prove termination of rewrite systems; however its extension to higher order rewrite systems is still the object of active research. We observe that a variant of refinement types allow us to express a form of higher-order dependency pair criterion that only uses information at the type level, and we prove the correctness of this criterion.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-267114