arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1101.0968cs.LO
收藏

作为高阶依赖对的细化类型

Refinement Types as Higher Order Dependency Pairs

Cody Roux

摘要:

细化类型是一种对函数式程序进行深入分析的方法。依赖对方法是证明重写系统可终止性的一种非常有效的方法,然而将其推广到高阶重写系统仍然是一个活跃的研究对象。我们观察到,细化类型的变体允许我们表达一种形式的高阶依赖对标准,只使用信息的类型级别,我们证明了这个标准的正确性。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑