PolyTOIL: A type-safe polymorphic object-oriented language

被引:18
作者
Bruce, KB [1 ]
Schuett, A
Van Gent, R
Fiech, A
机构
[1] Williams Coll, Dept Comp Sci, Williamstown, MA 01267 USA
[2] Mem Univ Newfoundland, St John, NF A1C 5S7, Canada
来源
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS | 2003年 / 25卷 / 02期
关键词
design; language; theory;
D O I
10.1145/641888.641891
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
PolyTOIL is a new statically typed polymorphic object-oriented programming language that is provably typesafe. By separating the definitions of subtyping and inheritance, providing a name for the type of self, and carefully defining the type-checking rules, we have obtained a language that is very expressive while supporting modular type-checking of classes. The matching relation on types, which is related to F-bounded quantification, is used both in stating type-checking rules and expressing the bounds on type parameters for polymorphism. The design of PolyTOIL is based on a careful formal definition of type-checking rules and semantics. A proof of type safety is obtained with the aid of a subject reduction theorem.
引用
收藏
页码:225 / 290
页数:66
相关论文
共 48 条
[1]  
Abadi M., 1994, Programming Languages and Systems - ESOP '94. 5th European Symposium on Programming. Proceedings, P1
[2]  
Abadi M., 1990, Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science (90CH2897-7), P355, DOI 10.1109/LICS.1990.113761
[3]  
Abadi M, 1995, LECT NOTES COMPUT SC, V915, P471
[4]  
Abadi M., 1996, A Theory Of Objects, DOI DOI 10.1007/978-1-4419-8598-9
[5]  
ABADI M, 1994, P THEOR ASP COMP SOF, P296
[6]   SUBTYPING RECURSIVE TYPES [J].
AMADIO, RM ;
CARDELLI, L .
ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1993, 15 (04) :575-631
[7]   RECURSION OVER REALIZABILITY STRUCTURES [J].
AMADIO, RM .
INFORMATION AND COMPUTATION, 1991, 91 (01) :55-85
[8]  
[Anonymous], ACM COMPUTING SURVEY
[9]  
ARNOLD K, 1996, JAVA
[10]  
Bracha G., 1993, P OOPSLA 93 C OBJ OR, P215