HIGHER-ORDER SUBTYPING

被引:0
|
作者
STEFFEN, M [1 ]
PIERCE, B [1 ]
机构
[1] UNIV EDINBURGH, DEPT COMP SCI, EDINBURGH EH9 3JZ, MIDLOTHIAN, SCOTLAND
关键词
OBJECT-ORIENTED PROGRAMMING (D.1.5); FORMAL DEFINITIONS AND THEORY (D.3.1); SEMANTICS OF PROGRAMMING LANGUAGES (F.3.2); STATIC TYPE SYSTEMS; LAMBDA-CALCULUS; POLYMORPHISM; SUBTYPING;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
System F-less than or equal to(w) is an extension with subtyping of Girard's higher-order polymorphic lambda-calculus. We develop the fundamental metatheory of this calculus: decidability of beta-conversion on well-kinded types, elimination of the ''cut-rule'' of transitivity from the subtype relation, and the soundness, completeness, and termination of algorithms for subtyping and typechecking.
引用
收藏
页码:511 / 530
页数:20
相关论文
共 50 条