On Realisability Semantics for Intersection Types with Expansion Variables

被引:0
|
作者
Kamareddine, Fairouz [1 ]
Nour, Karim [2 ]
Rahli, Vincent [3 ]
Wells, J. B. [3 ]
机构
[1] Heriot Watt Univ, Sch Math & Comp Sci, ULTRA Grp Useful Log Types Rewriting & Their Auto, Edinburgh EH14 4AS, Midlothian, Scotland
[2] Univ Savoie, F-73378 Le Bourget Du Lac, France
[3] Heriot Watt Univ, ULTRA Grp, Edinburgh EH14 4AS, Midlothian, Scotland
关键词
Realisability semantics; expansion variables; intersection types; completeness; LAMBDA-TERMS;
D O I
10.3233/FI-2012-774
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Expansion is a crucial operation for calculating principal typings in intersection type systems. Because the early definitions of expansion were complicated, E-variables were introduced in order to make the calculations easier to mechanise and reason about. Recently, E-variables have been further simplified and generalised to also allow calculating other type operators than just intersection. There has been much work on semantics for type systems with intersection types, but none whatsoever before our work, on type systems with E-variables. In this paper we expose the challenges of building a semantics for E-variables and we provide a novel solution. Because it is unclear how to devise a space of meanings for E-variables, we develop instead a space of meanings for types that is hierarchical. First, we index each type with a natural number and show that although this intuitively captures the use of E-variables, it is difficult to index the universal type. with this hierarchy and it is not possible to obtain completeness of the semantics if more than one E-variable is used. We then move to a more complex semantics where each type is associated with a list of natural numbers and establish that both. and an arbitrary number of E-variables can be represented without losing any of the desirable properties of a realisability semantics.
引用
收藏
页码:153 / 184
页数:32
相关论文
共 50 条