Polarized higher-order subtyping

[1]  Benjamin C. Pierce,et al.  Pict: a programming language based on the Pi-Calculus , 2000, Proof, Language, and Interaction.

[2]  John C. Mitchell,et al.  Type Systems for Programming Languages , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[3]  William R. Cook,et al.  A self-ish model of inheritance , 1987 .

[4]  Benjamin C. Pierce,et al.  Statically typed friendly functions via partially abstract types , 1993 .

[5]  Giorgio Ghelli,et al.  Coherence of Subsumption , 1990, CAAP.

[6]  Adriana Compagnoni,et al.  Decidable Higher Order Subtyping , 1997 .

[7]  Healfdene Goguen.  A typed operational semantics for type theory , 1994 .

[8]  Luca Cardelli,et al.  Operations on Records , 1989, Mathematical Foundations of Programming Semantics.

[9]  Roberto M. Amadio,et al.  Recursion over Realizability Structures , 1991, Inf. Comput..

[10]  Luca Cardelli,et al.  Subtyping recursive types , 1991, POPL '91.

[11]  Uday S. Reddy,et al.  Objects as closures: abstract semantics of object-oriented languages , 1988, LISP and Functional Programming.

[12]  John C. Mitchell,et al.  Foundations for programming languages , 1996, Foundation of computing series.

[13]  B. Pierce,et al.  Local Type Argument Synthesis with Bounded Quantification , 1997 .

[14]  Larry Carter,et al.  Distrbution and Abstract Types in Emerald , 1987, IEEE Transactions on Software Engineering.

[15]  Thierry Coquand,et al.  Inheritance as Implicit Coercion , 1991, Inf. Comput..

[16]  Martin Hofmann,et al.  A unifying type-theoretic framework for objects , 1994, Journal of Functional Programming.

[17]  Randall B. Smith,et al.  Self: The power of simplicity , 1987, OOPSLA 1987.

[18]  G. C. Wraith.  A Note on Categorical Datatypes , 1989, Category Theory and Computer Science.

[19]  J. Y. Girard,et al.  Interpretation fonctionelle et elimination des coupures dans l'aritmetique d'ordre superieur , 1972 .

[20]  John C. Mitchell,et al.  Type Inference with Extended Pattern Matching and Subtypes , 1993, Fundamenta Informaticae.

[21]  Craig Schaffert,et al.  An introduction to Trellis/Owl , 1986, OOPSLA 1986.

[22]  Martin Odersky,et al.  Pizza into Java: translating theory into practice , 1997, POPL '97.

[23]  Jens Palsberg,et al.  Object-oriented type systems , 1994, Wiley professional computing.

[24]  Benjamin C. Pierce,et al.  Bounded quantification is undecidable , 1992, POPL '92.

[25]  Roberto Ierusalimschy,et al.  Types in school , 1993, SIGP.

[26]  Mario Coppo,et al.  Type Inference with Recursive Types: Syntax and Semantics , 1991, Inf. Comput..

[27]  B. Pierce,et al.  Typing and subtyping for mobile processes , 1993, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science.

[28]  John C. Mitchell,et al.  A Delegation-based Object Calculus with Subtying , 1995, FCT.

[29]  John C. Mitchell,et al.  F-bounded polymorphism for object-oriented programming , 1989, FPCA.

[30]  Luca Cardelli,et al.  A language with distributed scope , 1995, POPL '95.

[31]  Benjamin C. Pierce,et al.  Higher-order intersection types and multiple inheritance , 1996, Mathematical Structures in Computer Science.

[32]  Mario Tokoro,et al.  An Object Calculus for Asynchronous Communication , 1991, ECOOP.

[33]  Alonzo Church,et al.  A formulation of the simple theory of types , 1940, Journal of Symbolic Logic.

[34]  米沢 明憲.  ABCL : an object-oriented concurrent system , 1990 .

[35]  Oscar Nierstrasz,et al.  Object-Based Concurrent Computing , 1991, Lecture Notes in Computer Science.

[36]  John C. Mitchell,et al.  Theoretical aspects of object-oriented programming: types, semantics, and language design , 1994, Choice Reviews Online.

[37]  Didier Rémy,et al.  Type checking records and variants in a natural extension of ML , 1989, POPL '89.

[38]  Giorgio Ghelli,et al.  Divergence of F< Type Checking , 1995, Theor. Comput. Sci..

[39]  Cliff B. Jones.  A pi-Calculus Semantics for an Object-Based Design Notation , 1993, CONCUR.

[40]  David C. Luckham,et al.  Polymorphism and Subtyping in Interfaces , 1994, Workshop on Interface Definition Languages.

[41]  Healfdene Goguen.  The Metatheory of UTT , 1994, TYPES.

[42]  John C. Mitchell,et al.  The Development of Type Systems for Object-Oriented Languages , 1995, Theory Pract. Object Syst..

[43]  William W. Tait,et al.  Intensional interpretations of functionals of finite type I , 1967, Journal of Symbolic Logic.

[44]  John C. Reynolds,et al.  Design of the programming language FORSYTHE , 1997 .

[45]  Kim B. Bruce.  Typing in object-oriented languages: Achieving expressiveness and safety , 1996 .

[46]  Jens Palsberg,et al.  A denotational model of inheritance and its correctness , 1989 .

[47]  Karl Crary,et al.  Foundations for the implementation of higher-order subtyping , 1997, ICFP '97.

[48]  R. Hindley.  The Principal Type-Scheme of an Object in Combinatory Logic , 1969 .

[49]  Benjamin C. Pierce,et al.  Higher-Order Subtyping , 1994, Theor. Comput. Sci..

[50]  Benjamin C. Pierce,et al.  Simple type-theoretic foundations for object-oriented programming , 1994, Journal of Functional Programming.

[51]  Luca Cardelli,et al.  On understanding types, data abstraction, and polymorphism , 1985, CSUR.

[52]  Craig Chambers,et al.  Object-Oriented Multi-Methods in Cecil , 1992, ECOOP.

[53]  Robert D. Tennent,et al.  Semantics of programming languages , 1991, Prentice Hall International Series in Computer Science.

[54]  Andreas V. Hense.  Polymorphic type inference for object-oriented programming languages , 1994 .

[55]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[56]  Rance Cleaveland,et al.  Implementing mathematics with the Nuprl proof development system , 1986 .

[57]  Benjamin C. Pierce,et al.  Local type inference , 1998, POPL '98.

[58]  Linda G. DeMichiel,et al.  The Common Lisp Object System: An Overview , 1987, ECOOP.

[59]  Luca Cardelli,et al.  Extensible records in a pure calculus of subtyping , 1994 .

[60]  Benjamin C. Pierce,et al.  Bounded Existentials and Minimal Typing , 1998, Theor. Comput. Sci..

[61]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[62]  Giorgio Ghelli.  Recursive Types Are not Conservative over F , 1993, TLCA.

[63]  Robin Milner,et al.  A Theory of Type Polymorphism in Programming , 1978, J. Comput. Syst. Sci..

[64]  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.

[65]  Martín Abadi,et al.  An interpretation of objects and object types , 1996, POPL '96.

[66]  Didier Rémy,et al.  Typing record concatenation for free , 1992, POPL '92.

[67]  Luca Cardelli,et al.  Typeful Programming , 1989, Formal Description of Programming Concepts.

[68]  Benjamin C. Pierce,et al.  Programming in higher-order typed lambda-calculi , 1989 .

[69]  Kim B. Bruce.  The Equivalence of Two Semantic Definitions for Inheritance in Object-Oriented Languages , 1991, MFPS.

[70]  Luca Cardelli,et al.  An Extension of System F with Subtyping , 1991, TACS.

[71]  David Aspinall,et al.  Subtyping dependent types , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[72]  W. Tait.  A realizability interpretation of the theory of species , 1975 .

[73]  Giorgio Ghelli,et al.  Coherence of Subsumption, Minimum Typing and Type-Checking in F<= , 1992, Math. Struct. Comput. Sci..

[74]  Benedict R. Gaster,et al.  A Polymorphic Type System for Extensible Records and Variants , 1996 .

[75]  William A. Howard,et al.  The formulae-as-types notion of construction , 1969 .

[76]  Stephen N. Freund,et al.  Adding type parameterization to the Java language , 1997, OOPSLA '97.

[77]  Giuseppe Castagna,et al.  Object-Oriented Programming A Unified Foundation , 1997, Progress in Theoretical Computer Science.

[78]  Gordon Plotkin,et al.  Semantics of Data Types , 1984, Lecture Notes in Computer Science.

[79]  Giuseppe Castagna,et al.  A calculus for overloaded functions with subtyping , 1992, LFP '92.

[80]  John C. Mitchell,et al.  Effective models of polymorphism, subtyping and recursion , 1995 .

[81]  Luca Cardelli,et al.  A Semantics of Multiple Inheritance , 1984, Information and Computation.

[82]  Frank Pfenning,et al.  On the Undecidability of Partial Polymorphic Type Reconstruction , 1993, Fundam. Informaticae.

[83]  Gordon D. Plotkin,et al.  An ideal model for recursive polymorphic types , 1984, Inf. Control..

[84]  Giuseppe Rosolini,et al.  Extensional PERs , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[85]  Akinori Yonezawa,et al.  Type-theoretic foundations for concurrent object-oriented programing , 1994, OOPSLA '94.

[86]  Kim B. Bruce.  A paradigmatic object-oriented programming language: Design, static typing and semantics , 1994, Journal of Functional Programming.

[87]  Adriana Compagnoni,et al.  Subject Reduction and Minimal Types for Higher Order Subtyping , 1997 .

[88]  Benjamin C. Pierce,et al.  Intersection types and bounded polymorphism , 1993, Mathematical Structures in Computer Science.

[89]  John C. Mitchell,et al.  Abstract types have existential types , 1985, POPL.

[90]  Giuseppe Castagna.  A Meta-Language for Typed Object-Oriented Languages , 1995, Theor. Comput. Sci..

[91]  Bertrand Meyer,et al.  Eiffel: The Language , 1991 .

[92]  Martín Abadi,et al.  On Subtyping and Matching , 1995, ECOOP.

[93]  Mitchell Wand,et al.  Type inference for record concatenation and multiple inheritance , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[94]  Craig Chambers,et al.  The cecil language: specification and rationale , 1993 .

[95]  Andrew C. Myers,et al.  Subtypes vs. where clauses: constraining parametric polymorphism , 1995, OOPSLA.

[96]  Zhaohui Luo,et al.  Developing Reuse Technology in Proof Engineering , 1995 .

[97]  Mario Tokoro,et al.  A Typing System for a Calculus of Objects , 1993, ISOTAS.

[98]  Luca Cardelli,et al.  On Binary Methods , 1995, Theory Pract. Object Syst..

[99]  Hans-Juergen Boehm.  Partial Polymorphic Type Inference Is Undecidable , 1985, FOCS.

[100]  Zhaohui Luo,et al.  A Unifying Theory of Dependent Types: The Schematic Approach , 1992, LFCS.

[101]  Simon Thompson,et al.  Type theory and functional programming , 1991, International computer science series.

[102]  Susumu Hayashi.  Singleton, Union and Intersection Types for Program Extraction , 1994, Inf. Comput..

[103]  Zhaohui Luo,et al.  Coercive Subtyping in Type Theory , 1996, CSL.

[104]  Jason J. Hickey.  Nuprl-Light: An Implementation Framework for Higher-Order Logics , 1997, CADE.

[105]  J. L Bank,et al.  Parameterized Types and Java , 1996 .

[106]  Adriana B. Compagnoni,et al.  Higher-order subtyping with intersection types , 1995 .

[107]  John C. Reynolds,et al.  Three Approaches to Type Structure , 1985, TAPSOFT, Vol.1.

[108]  Gang Chen,et al.  Subtyping Parametric and Dependent Types , 1996 .

[109]  John C. Reynolds,et al.  Towards a theory of type structure , 1974, Symposium on Programming.

[110]  Luca Cardelli,et al.  Basic Polymorphic Typechecking , 1987, Sci. Comput. Program..

[111]  Martín Abadi,et al.  Baby Modula-3 and a theory of objects , 1994, Journal of Functional Programming.

[112]  Vasco Thudichum Vasconcelos,et al.  Typed Concurrent Objects , 1994, ECOOP.

[113]  Luca Cardelli.  An implementation of F , 1993 .

[114]  Jens Palsberg,et al.  A Denotational Semantics of Inheritance and Its Correctness , 1994, Inf. Comput..

[115]  J. B. Wells.  Typability and type checking in the second-order Λ-calculus are equivalent and undecidable (Preliminary Draft) , 1993 .

[116]  Grzegorz Rozenberg,et al.  Foundations of Object-Oriented Languages , 1991 .

[117]  P. Martin-Löf.  An Intuitionistic Theory of Types: Predicative Part , 1975 .

[118]  David Robson,et al.  Smalltalk-80: The Language and Its Implementation , 1983 .

[119]  Mitchell Wand,et al.  Complete Type Inference for Simple Objects , 1987, LICS.

[120]  J. Girard,et al.  Proofs and types , 1989 .