## The Lazy Lambda Calculus (1990)

Venue: | Research Topics in Functional Programming |

Citations: | 238 - 3 self |

### BibTeX

@INPROCEEDINGS{Abramsky90thelazy,

author = {Samson Abramsky},

title = {The Lazy Lambda Calculus},

booktitle = {Research Topics in Functional Programming},

year = {1990},

pages = {65--116},

publisher = {Addison-Wesley}

}

### Years of Citing Articles

### OpenURL

### Abstract

Introduction The commonly accepted basis for functional programming is the -calculus; and it is folklore that the -calculus is the prototypical functional language in puri ed form. But what is the -calculus? The syntax is simple and classical; variables, abstraction and application in the pure calculus, with applied calculi obtained by adding constants. The further elaboration of the theory, covering conversion, reduction, theories and models, is laid out in Barendregt's already classical treatise [Bar84]. It is instructive to recall the following crux, which occurs rather early in that work (p. 39): Meaning of -terms: rst attempt The meaning of a -term is its normal form (if it exists). All terms without normal forms are identi ed. This proposal incorporates such a simple and natural interpretation of the -calculus as