
The Lambda Calculus. Its Syntax and Semantics
Henk Barendregt(Author)
College Publications (Publisher)
Published on 30. April 2012
Book
Paperback/Softback
656 pages
978-1-84890-066-0 (ISBN)
Description
The Lambda Calculus, treated in this book mainly in its untyped version, consists of a collection of expressions, called lambda terms, together with ways how to rewrite and identify these. In the parts conversion, reduction, theories, and models the view is respectively 'algebraic', computational, with more ('coinductive') identifications, and finally set-theoretic.
The lambda terms are built up from variables, using application and abstraction. Applying a term F to M has as intention that F is a function, M its argument, and FM the result of the application. This is only the intention: to actually obtain the result one has to rewrite the expression FM according to
the reduction rules. Abstraction provides a way to create functions according to the effect when applying them.
The power of the theory comes from the fact that computations, both terminating and infinite, can be expressed by lambda terms at a 'comfortable' level of abstraction.
More details
Language
English
Place of publication
London
United Kingdom
Product notice
Paperback (trade)
Illustrations
black & white illustrations
Dimensions
Height: 234 mm
Width: 156 mm
Thickness: 36 mm
Weight
980 gr
ISBN-13
978-1-84890-066-0 (9781848900660)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification