62,094 research outputs found
Refinement Types as Higher Order Dependency Pairs
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
Banana and plantain (Musa) genomics: Missing opportunity?
Poster presented at 2009 Annual Research Meeting of the Generation Challenge Programme. Bamako (Mali), 20-23 Sep 200
- …