Lambda Calculus. Its Syntax & Semantics

Lambda Calculus. Its Syntax & Semantics

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.

Auteur | Henk Barendregt
Taal | Engels
Type | Paperback
Categorie | Computers & Informatica

bol logo

Kijk verder

Boekomslag voor ISBN: 9780486478838
Boekomslag voor ISBN: 9781904987178
Boekomslag voor ISBN: 9780521663502
Boekomslag voor ISBN: 9780521114295
Boekomslag voor ISBN: 9781848900646
Boekomslag voor ISBN: 9781584887430


Boekn ©