A Theory of Type Polymorphism in Programming

[1]  Robin Milner,et al.  Edinburgh LCF , 1979, Lecture Notes in Computer Science.

[2]  John C. Reynolds,et al.  Syntactic control of interference , 1978, POPL.

[3]  Robin Milner,et al.  A Metalanguage for interactive proof in LCF , 1978, POPL.

[4]  William W. Wadge,et al.  Data Types as Objects , 1977, ICALP.

[5]  J. J. Horning,et al.  Report on the programming language Euclid , 1977, SIGP.

[6]  B. J. Mailloux,et al.  Revised Report on the Algorithmic Language ALGOL 68 , 1976, SIGP.

[7]  Dana S. Scott,et al.  Data Types as Lattices , 1976, SIAM J. Comput..

[8]  Gordon D. Plotkin,et al.  A Powerdomain Construction , 1976, SIAM J. Comput..

[9]  Mary Shaw,et al.  Abstraction and Verification in Alphard: Introduction to Language and Methodology , 1976 .

[10]  GriesDavid,et al.  Some ideas on data types in high-level languages , 1977 .

[11]  William H. Burge,et al.  Recursive Programming Techniques , 1975 .

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

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

[14]  Stephen N. Zilles,et al.  Programming with abstract data types , 1974, SIGPLAN Symposium on Very High Level Languages.

[15]  D. Scott.  Models for Various Type-Free Calculi , 1973 .

[16]  R. Milner.  Models of LCF. , 1973 .

[17]  Christopher Strachey,et al.  Toward a mathematical semantics for computer languages , 1971 .

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

[19]  James H. Morris,et al.  Lambda-calculus models of programming languages. , 1969 .

[20]  P. J. Landin,et al.  The next 700 programming languages , 1966, CACM.

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