Trending Bestseller

The Lambda Calculus. Its Syntax and Semantics

No reviews yet Write a Review
Paperback / softback
30 April 2012
$39.09
Ships in 3-5 business days

Delivery estimate

Hurry up! Current stock:
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 tothe 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.

You Can Find This Title In

    Product Details
    ISBN-13
    9781848900660
    Author
    Henk Barendregt
    Publisher
    College Publications
    Published
    30 April 2012
    Format
    Paperback / softback

    This product hasn't received any reviews yet. Be the first to review this product!

    $39.09
    Ships in 3-5 business days

    Delivery estimate

    Hurry up! Current stock:

    The Lambda Calculus. Its Syntax and Semantics

    $39.09

    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 tothe 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.

    You Can Find This Title In

      This Title Is Categorised As