DeepRead
Cover of The lambda calculus

The lambda calculus

H. P. Barendregt · 1981

Programming and computer science › Lisp and Scheme

#6,472 most recommended

About the book

A comprehensive mathematical treatment of the untyped lambda calculus and the related combinatory logic, covering their syntax, reduction and equality theories, and the notion of computability they define. It is written as a systematic reference for researchers in logic, theoretical computer science and the foundations of functional programming. The lambda calculus is presented as a rigorous and self-contained foundation for the theory of functions as rules of computation, rather than as sets of input-output pairs. The book develops the central results needed to support that view, including the Church-Rosser property and the standardization theorem, which establish the consistency and normalization behaviour of reduction. It also treats the semantics of the calculus through models, notably those of Scott, to show that it can be given mathematical meaning, and it relates the calculus to lambda-definability and the theory of recursive functions.

Written by Claude from what it knows of this book.

What Hacker News says 60% recommend · 0% critical

024201120122014201620182013 peak · 3
This bookAverage book in Lisp and Scheme

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 3 want to read
  • 1 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

The threads it came up in

Details

First published
1981
ISBN
9781848900660
Editions known
10 at Open Library
Open Library
OL5356442W

CalculusLambda calculus

Explore in the mosaic

Read next: its neighbours on the mosaic