You might also like

More about Lambda Calculus. Its Syntax and Semantics

• Book details
• Synopsis
• Trending among others

You get 91 loyalty points

Book synopsis

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.

Book details

Book category Books in English Computing & information technology Computer science Artificial intelligence

• Full title: Lambda Calculus. Its Syntax and Semantics
• Author: Henk Barendregt
• Language: English
• Binding: Paperback
• Number of pages: 656
• EAN: 9781848900660
• ISBN: 184890066X
• ID: 05190325
• Publisher: College Publications
• Weight: 956 g
• Dimensions: 158 × 226 × 36 mm
• Date of publishing: 30. April 2012

Trending among others

---

---

---