Type checking and type deduction techniques for polymorphic programming languages

[1]  Rod M. Burstall,et al.  HOPE: An experimental applicative language , 1980, LISP Conference.

[2]  Alan J. Demers,et al.  Data types, parameters and type checking , 1980, POPL '80.

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

[4]  Robin Milner,et al.  A proposal for standard ML , 1984, LFP '84.

[5]  John C. Mitchell,et al.  Coercion and type inference , 1984, POPL.

[6]  Daniel Leivant,et al.  The Expressiveness of Simple and Second-Order Type Structures , 1983, JACM.

[7]  Michael J. C. Gordon,et al.  Edinburgh LCF: A mechanised logic of computation , 1979 .

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

[9]  Gérard P. Huet,et al.  Proofs by induction in equational theories with constructors , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[10]  Mariangiola Dezani-Ciancaglini,et al.  Functional Characters of Solvable Terms , 1981, Math. Log. Q..

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

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

[13]  M. M. Fokkinga.  On the notion of strong typing , 1981 .

[14]  D. Prawitz.  Ideas and Results in Proof Theory , 1971 .

[15]  Elio Giovannetti,et al.  Completeness Results for a Polymorphic Type System , 1983, CAAP.

[16]  J. Fairbairn,et al.  Ponder and its type system , 1982 .

[17]  Mitchell Wand,et al.  A types-as-sets semantics for milner-style polymorphism , 1984, POPL.

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

[19]  John Mitchell,et al.  Type Inference and Type Containment , 1984, Semantics of Data Types.

[20]  James Hook,et al.  Understanding Russell- A First Attempt , 1984, Semantics of Data Types.

[21]  Nancy Jean Mccracken,et al.  An investigation of a programming language with a polymorphic type structure. , 1979 .

[22]  Mario Coppo,et al.  An Extended Polymorphic Type System for Applicative Languages , 1980, MFCS.

[23]  Christopher T. Haynes.  A Theory of Data Type Representation Independence , 1984, Semantics of Data Types.

[24]  Ravi Sethi,et al.  A semantic model of types for applicative languages , 1982, LFP '82.

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

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

[27]  Craig Schaffert,et al.  Abstraction mechanisms in CLU , 1977 .

[28]  Mariangiola Dezani-Ciancaglini,et al.  A filter lambda model and the completeness of type assignment , 1983, Journal of Symbolic Logic.

[29]  Daniel Leivant,et al.  Polymorphic type inference , 1983, POPL '83.

[30]  Nancy McCracken,et al.  The Typechecking of Programs with Implicit Type Structure , 1984, Semantics of Data Types.

[31]  Mike Paterson,et al.  Linear unification , 1976, STOC '76.

[32]  J. Roger Hindley,et al.  The Completeness Theorem for Typing lambda-Terms , 1983, Theor. Comput. Sci..

[33]  Ben Wegbreit,et al.  The treatment of data types in EL1 , 1974, CACM.

[34]  Alberto Martelli,et al.  An Efficient Unification Algorithm , 1982, TOPL.