Higher-Order Subtyping
暂无分享,去创建一个
[1] Martín Abadi,et al. A Theory of Objects , 1996, Monographs in Computer Science.
[2] Giorgio Ghelli,et al. Divergence of F< Type Checking , 1995, Theor. Comput. Sci..
[3] Giuseppe Castagna,et al. Corrigendum: decidable bounded quantification , 1995, POPL '95.
[4] John C. Mitchell,et al. Theoretical aspects of object-oriented programming: types, semantics, and language design , 1994, Choice Reviews Online.
[5] Martín Abadi,et al. A Theory of Primitive Objects: Second-Order Systems , 1995, Sci. Comput. Program..
[6] Martin Hofmann,et al. A unifying type-theoretic framework for objects , 1994, Journal of Functional Programming.
[7] Adriana B. Compagnoni,et al. Higher-order subtyping with intersection types , 1995 .
[8] Adriana B. Compagnoni,et al. Decidability of Higher-Order Subtyping with Intersection Types , 1994, CSL.
[9] Luca Cardelli,et al. Extensible records in a pure calculus of subtyping , 1994 .
[10] Erik Poll,et al. Pure Type Systems with Definitions , 1994, LFCS.
[11] Martín Abadi,et al. A Theory of Primitive Objects - Untyped and First-Order Systems , 1994, TACS.
[12] Martín Abadi,et al. Baby Modula-3 and a theory of objects , 1994, Journal of Functional Programming.
[13] Kim B. Bruce. A paradigmatic object-oriented programming language: Design, static typing and semantics , 1994, Journal of Functional Programming.
[14] Benjamin C. Pierce,et al. Simple type-theoretic foundations for object-oriented programming , 1994, Journal of Functional Programming.
[15] Giuseppe Castagna,et al. Decidable bounded quantification , 1994, POPL '94.
[16] Decidable Bounded Quantiication , 1994 .
[17] John C. Mitchell,et al. A lambda calculus of objects and method specialization , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.
[18] Giorgio Ghelli. Recursive Types Are not Conservative over F , 1993, TLCA.
[19] Kim B. Bruce. Safe type checking in a statically-typed object-oriented programming language , 1993, POPL '93.
[20] Benjamin C. Pierce,et al. Object-oriented programming without recursive types , 1993, POPL '93.
[21] Benjamin C. Pierce,et al. Statically typed friendly functions via partially abstract types , 1993 .
[22] Giorgio Ghelli,et al. Coherence of Subsumption, Minimum Typing and Type-Checking in F<= , 1992, Math. Struct. Comput. Sci..
[23] John C. Mitchell,et al. PER models of subtyping, recursive types and higher-order polymorphism , 1992, POPL '92.
[24] Benjamin C. Pierce,et al. Bounded quantification is undecidable , 1992, POPL '92.
[25] Giuseppe Castagna,et al. A calculus for overloaded functions with subtyping , 1992, LFP '92.
[26] B. Pierce. Programming with intersection types and bounded polymorphism , 1992 .
[27] Luca Cardelli,et al. An Extension of System F with Subtyping , 1991, TACS.
[28] Thierry Coquand,et al. Inheritance as Implicit Coercion , 1991, Inf. Comput..
[29] Luca Cardelli,et al. A semantic basis for quest , 1990, Journal of Functional Programming.
[30] F. Cardone,et al. Two extensions of Curry's type inference system , 1990 .
[31] Piergiorgio Odifreddi,et al. Logic and computer science , 1990 .
[32] William R. Cook,et al. Canning: inheritance is not subtyping , 1990 .
[33] John C. Mitchell. Toward a typed foundation for method specialization and inheritance , 1989, POPL '90.
[34] William R. Cook,et al. Inheritance is not subtyping , 1989, POPL '90.
[35] Mitchell Wand,et al. Type inference for record concatenation and multiple inheritance , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.
[36] John C. Mitchell,et al. F-bounded quantification for object-oriented programming , 1989 .
[37] J. Girard,et al. Proofs and types , 1989 .
[38] J. Gallier. On Girard's "Candidats de Reductibilité" , 1989 .
[39] M. Wand,et al. Corrigendum: complete type interference for simple objects , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.
[40] Kim B. Bruce,et al. A modest model of records, inheritance and bounded quantification , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.
[41] Luca Cardelli,et al. Structural subtyping and the notion of power type , 1988, POPL '88.
[42] Simon Martini. Bounded quantifiers have interval models , 1988, LFP '88.
[43] Mitchell Wand,et al. Complete Type Inference for Simple Objects , 1987, LICS.
[44] Luca Cardelli,et al. On understanding types, data abstraction, and polymorphism , 1985, CSUR.
[45] Henk Barendregt,et al. The Lambda Calculus: Its Syntax and Semantics , 1985 .
[46] Luca Cardelli,et al. A Semantics of Multiple Inheritance , 1984, Inf. Comput..
[47] Mariangiola Dezani-Ciancaglini,et al. A new type assignment for λ-terms , 1978, Arch. Math. Log..
[48] John C. Reynolds,et al. Towards a theory of type structure , 1974, Symposium on Programming.
[49] Alonzo Church,et al. A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.