Records, variants and qualified types

viii

[1]  Andrew K. Wright.  Simple imperative polymorphism , 1995, LISP Symb. Comput..

[2]  Philip Wadler,et al.  How to make ad-hoc polymorphism less ad hoc , 1989, POPL '89.

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

[4]  Barney P. Hilken,et al.  Towards a categorical semantics of type classes , 1991, Fundam. Informaticae.

[5]  Xavier Leroy,et al.  Polymorphism by name for references and continuations , 1993, POPL '93.

[6]  Carl A. Gunter.  Semantics of programming languages: structures and techniques , 1993, Choice Reviews Online.

[7]  Andrew Kennedy.  Type Inference and Equational Theories , 1996 .

[8]  R. A. G. Seely,et al.  Categorical semantics for higher order polymorphic lambda calculus , 1987, Journal of Symbolic Logic.

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

[10]  Mark P. Jonesy.  A Theory of Qualiied Types , 1992 .

[11]  Mark P. Jones.  A system of constructor classes: overloading and implicit higher-order polymorphism , 1993, FPCA '93.

[12]  H. Piaggio.  Logic for Mathematicians , 1954, Nature.

[13]  Philip Wadler,et al.  Theorems for free! , 1989, FPCA.

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

[15]  Thierry Coquand.  On the analogy between propositions and types , 1986 .

[16]  A. M. Turing.  The þ-function in λ- K -conversion , 1937 .

[17]  Simon L. Peyton Jones,et al.  Report on the programming language Haskell: a non-strict, purely functional language version 1.2 , 1992, SIGP.

[18]  Martin Odersky,et al.  Type Inference with Constrained Types , 1999, Theory Pract. Object Syst..

[19]  John C. Reynolds,et al.  Types, Abstraction and Parametric Polymorphism , 1983, IFIP Congress.

[20]  John C. Mitchell,et al.  Notes on Sconing and Relators , 1992, CSL.

[21]  S. Lane.  Categories for the Working Mathematician , 1971 .

[22]  Robin Milner,et al.  Principal type-schemes for functional programs , 1982, POPL '82.

[23]  Roy L. Crole,et al.  Categories for Types , 1994, Cambridge mathematical textbooks.

[24]  John C. Reynolds,et al.  Types, Abstractions, and Parametric Polymorphism, Part 2 , 1991, MFPS.

[25]  Mark P. Jones.  Simplifying and improving qualified types , 1995, FPCA '95.

[26]  Atsushi Ohori,et al.  A simple semantics for ML polymorphism , 1989, FPCA.

[27]  Atsushi Ohori,et al.  A polymorphic record calculus and its compilation , 1995, TOPL.

[28]  Bjarne Stroustrup,et al.  C++ Programming Language , 1986, IEEE Softw..

[29]  Luca Cardelli,et al.  Operations on records , 1989, Mathematical Structures in Computer Science.

[30]  Michael P. Fourman,et al.  A Proposed Categorial Semantics for Pure ML , 1992, ICALP.

[31]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

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

[33]  Erik Meijer,et al.  The Design and Implementation of Mondrian , 1997 .

[34]  Robert Harper,et al.  Extensible records without subsumption , 1990 .

[35]  Luca Cardelli,et al.  A Semantics of Multiple Inheritance , 1984, Inf. Comput..

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

[37]  Philip Wadler,et al.  Comprehending monads , 1990, Mathematical Structures in Computer Science.

[38]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..

[39]  John C. Reynolds,et al.  Polymorphism is not Set-Theoretic , 1984, Semantics of Data Types.

[40]  Richard Statman,et al.  Logical Relations and the Typed lambda-Calculus , 1985, Inf. Control..

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

[42]  Mark P. Jones.  Dictionary-free overloading by partial evaluation , 1995, LISP Symb. Comput..

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

[44]  Graham Hutton,et al.  Bananas in space: extending fold and unfold to exponential types , 1995, FPCA '95.

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

[46]  Martin Odersky,et al.  A second look at overloading , 1995, FPCA '95.

[47]  Ken Arnold,et al.  The Java Programming Language , 1996 .

[48]  John C. Mitchell,et al.  On the type structure of standard ML , 1993, TOPL.

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

[50]  Martin Sulzmann.  Designing Record Systems , 1997 .

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

[52]  James Gosling,et al.  The Java Programming Language" The Java Series , 1996 .

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

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

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

[56]  Benjamin C. Pierce,et al.  A record calculus based on symmetric concatenation , 1991, POPL '91.

[57]  M. Tofte.  Operational Semantics and Polymorphic Type Inference , 1988 .

[58]  M. Wand,et al.  Corrigendum: complete type interference for simple objects , 1988, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[59]  Jon L. White.  Proceedings of the 1992 ACM conference on LISP and functional programming , 1992 .

[60]  Timothy A. Budd,et al.  An introduction to object-oriented programming , 1991 .

[61]  Troy Downing,et al.  Java Virtual Machine , 1997 .

[62]  Christopher Strachey,et al.  Fundamental Concepts in Programming Languages , 2000, High. Order Symb. Comput..

[63]  Luís Damas.  Type assignment in programming languages , 1984 .

[64]  A. Pitts.  INTRODUCTION TO HIGHER ORDER CATEGORICAL LOGIC (Cambridge Studies in Advanced Mathematics 7) , 1987 .

[65]  Didier Rémy,et al.  Type inference for records in natural extension of ML , 1994 .

[66]  Mark P. Jones.  Computing with Lattices: An Application of Type Classes , 1992, J. Funct. Program..

[67]  Matthias Felleisen,et al.  A Syntactic Approach to Type Soundness , 1994, Inf. Comput..

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

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

[70]  Harry G. Mairson.  Quantifier elimination and parametric polymorphism in programming languages , 1992, Journal of Functional Programming.

[71]  Atsushi Ohori,et al.  A compilation method for ML-style polymorphic record calculi , 1992, POPL '92.

[72]  Stephen Blott.  An approach to overloading with polymorphism , 1991 .