Decidable Higher Order Subtyping

msra（1997）

引用 24|浏览4

暂无评分

摘要

This paper establishes the decidability of typechecking in F! ^ , a typed lambda calculus combining higher-order polymorphism, subtyping, and intersection types. It contains the rst proof of decidability of subtyping for a higher-order system.

查看译文

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要