Types in Lambda Calculi and Programming Languages

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

[2]  Hendrik Pieter Barendregt,et al.  Functional Programming and Lambda Calculus , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[3]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[4]  Robert D. Tennent,et al.  Elementary Data Structures in ALGOL-Like Languages , 1989, Sci. Comput. Program..

[5]  Hans-Juergen Boehm.  Type inference in the presence of type abstraction , 1989, PLDI '89.

[6]  David K. Gifford,et al.  Type reconstruction with first-class polymorphic values , 1989, PLDI '89.

[7]  Jerzy Tiuryn,et al.  Computational consequences and partial solutions of a generalized unification problem , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[8]  Thierry Coquand,et al.  The Calculus of Constructions , 1988, Inf. Comput..

[9]  Frank Pfenning,et al.  Partial polymorphic type inference and higher-order unification , 1988, LISP and Functional Programming.

[10]  Hendrik Pieter Barendregt,et al.  Functional Programming and the Language TALE , 1986, Current Trends in Concurrency.

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

[12]  Robin Milner,et al.  Standard ML: Report ECS-LFCS-86-2 , 1986 .

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

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

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

[16]  Hartmut Ehrig,et al.  Mathematical Foundations of Software Development , 1985, Lecture Notes in Computer Science.

[17]  D. A. Turner,et al.  Miranda: A Non-Strict Functional language with Polymorphic Types , 1985, FPCA.

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

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

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

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

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

[23]  Daniel Lehmann.  Modes in Algol Y , 1977 .

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

[25]  B. J. Mailloux,et al.  Report on the Algorithmic Language , 1971 .

[26]  B. J. Mailloux,et al.  Report on the Algorithmic Language ALGOL 68 , 1969 .

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

[28]  B. J. Mailloux,et al.  Report of Algorithmic Language ALGOL 68 , 1969 .

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

[30]  H B Curry,et al.  Functionality in Combinatory Logic. , 1934, Proceedings of the National Academy of Sciences of the United States of America.