The lazy lambda calculus

[1]  Samson Abramsky,et al.  A Domain Equation for Bisimulation , 1991, Inf. Comput..

[2]  Edmund Robinson,et al.  Categories of Partial Maps , 1988, Inf. Comput..

[3]  E. Moggi.  The partial lambda calculus , 1988 .

[4]  Samson Abramsky,et al.  Domain Theory in Logical Form , 1991, LICS.

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

[6]  J. Lambek,et al.  Introduction to higher order categorical logic , 1986 .

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

[8]  Eugenio Moggi,et al.  Categories of Partial Morphisms and the lambdap - Calculus , 1985, CTCS.

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

[10]  Lennart Augustsson,et al.  A compiler for lazy ML , 1984, LFP '84.

[11]  M. Dezani-Ciancaglini,et al.  Extended Type Structures and Filter Lambda Models , 1984 .

[12]  Jon Fairbairn,et al.  Design and implementation of a simple typed language based on the lambda-calculus , 1984 .

[13]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

[14]  C. Pollard,et al.  Center for the Study of Language and Information , 2022 .

[15]  Christiaan Peter Jozef Koymans,et al.  Models of the Lambda Calculus , 1982, Inf. Control..

[16]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[17]  Robin Milner,et al.  Fully Abstract Models of Typed lambda-Calculi , 1977, Theor. Comput. Sci..

[18]  Yiannis N. Moschovakis,et al.  Elementary induction on abstract structures , 1974 .

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

[20]  P. J. Landin,et al.  Correspondence between ALGOL 60 and Church's Lambda-notation , 1965, Commun. ACM.

[21]  Otto C. Juelich,et al.  On the recursive programming techniques , 1964, CACM.

[22]  P. J. Landin.  The Mechanical Evaluation of Expressions , 1964, Comput. J..