The Lambda Calculus. Its Syntax and Semantics (Paperback, New)

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.

General

Imprint:	College Publications
Country of origin:	United Kingdom
Release date:	April 2012
First published:	April 2012
Authors:	Henk Barendregt
Dimensions:	234 x 154 x 34mm (L x W x T)
Format:	Paperback - Trade
Pages:	621
Edition:	New
ISBN-13:	978-1-84890-066-0
Categories:	Books > Computing & IT > Applications of computing > Artificial intelligence > General
LSN:	1-84890-066-X
Barcode:	9781848900660

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!