Bounded Existentials and Minimal Typing
暂无分享,去创建一个
[1] Giorgio Ghelli,et al. Divergence of F< Type Checking , 1995, Theor. Comput. Sci..
[2] John C. Mitchell,et al. Theoretical aspects of object-oriented programming: types, semantics, and language design , 1994, Choice Reviews Online.
[3] Giorgio Ghelli. Recursive Types Are not Conservative over F , 1993, TLCA.
[4] Luca Cardelli. An implementation of F , 1993 .
[5] Giorgio Ghelli,et al. Coherence of Subsumption, Minimum Typing and Type-Checking in F<= , 1992, Math. Struct. Comput. Sci..
[6] Benjamin C. Pierce,et al. Bounded quantification is undecidable , 1992, POPL '92.
[7] Luca Cardelli,et al. An Extension of System F with Subtyping , 1991, TACS.
[8] John C. Mitchell,et al. Abstract types have existential type , 1988, TOPL.
[9] Luca Cardelli,et al. On understanding types, data abstraction, and polymorphism , 1985, CSUR.
[10] Renzo Orsini,et al. GALILEO: a strongly-typed, interactive conceptual language , 1985, TODS.