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.
Price: 52.14 AUD
Location: Hillsdale, NSW
End Time: 2024-10-31T18:13:28.000Z
Shipping Cost: 32.94 AUD
Product Images
Item Specifics
Return shipping will be paid by: Buyer
Returns Accepted: Returns Accepted
Item must be returned within: 60 Days
Return policy details:
EAN: 9781848900660
UPC: 9781848900660
ISBN: 9781848900660
MPN: N/A
Book Title: The Lambda Calculus. Its Syntax and Semantics by B
Item Length: 23.4 cm
Number of Pages: 656 Pages
Language: English
Publication Name: The Lambda Calculus. Its Syntax and Semantics
Publisher: College Publications
Publication Year: 2012
Subject: Computer Science
Item Height: 234 mm
Item Weight: 906 g
Type: Textbook
Author: Henk Barendregt
Item Width: 156 mm
Format: Paperback
