2000 character limit reached
Refinement Types as Higher Order Dependency Pairs (1101.0968v2)
Published 5 Jan 2011 in cs.LO
Abstract: 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.