A lambda calculus of incomplete objects

被引:0
作者
Bono, V [1 ]
Bugliesi, M [1 ]
Liquori, L [1 ]
机构
[1] UNIV PADUA, DIPARTIMENTO MATEMAT, I-35131 PADUA, ITALY
来源
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1996 | 1996年 / 1113卷
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper extends the Lambda Calculus of Objects as proposed in [5] with a new support for incomplete objects. Incomplete objects behave operationally as ''standard'' objects; their typing, instead, is different, as they may be typed even though they contain references to methods that are yet to be added. As a byproduct, incomplete objects may be typed independently of the order of their methods and, consequently, the operational semantics of the untyped calculus may be soundly defined relying on a permutation rule that treats objects as sets of methods. The new type system is a conservative extension of the system of [5] that retains the mytype specialization property for inherited methods peculiar to [5], as well as the ability to statically detect run-time errors such as message not understood.
引用
收藏
页码:218 / 229
页数:12
相关论文
共 9 条
[1]  
ABADI M, 1994, LECTURE NOTES COMPUT, V789, P296
[2]  
[Anonymous], 1983, SMALLTALK 80 LANGUAG
[3]  
BONO V, UNPUB CALCULUS INCOM
[4]  
BONO V, 1995, LNCS, V933
[5]  
ELLIS E, 1990, ANNOTATED CPLUSPLUS
[6]  
Fisher K., 1994, Nordic Journal of Computing, V1, P3
[7]  
FISHER K, 1995, IN PRESS LECT NOTES
[8]  
MICHELL JC, 1990, P 17 ACM S PRINC PRO, P109
[9]  
UNGAR D, 1987, P OOPSLA 87, P227