BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

The Lambda Calculus. Its Syntax and Semantics

The Lambda Calculus. Its Syntax and Semantics

The Lambda Calculus. Its Syntax and Semantics
Stock photo: cover may vary

The Lambda Calculus. Its Syntax and Semantics Papeback -

by Henk Barendregt

Add to wish list
  • New
New

Description

pp. 656 . Papeback. New.
Ask the seller a question Add to wish list
A$91.12
A$5.74 Delivery within USA
Standard delivery: 9 to 14 days
More delivery options
Ships from Cold Books (New York, United States)

Details

  • Title The Lambda Calculus. Its Syntax and Semantics
  • Author Henk Barendregt
  • Binding Papeback
  • Condition New
  • Pages 656
  • Volumes 1
  • Language ENG
  • Publisher College Publications, London
  • Publication date pp. 656
  • Bookseller's Inventory # 6101354398
  • ISBN 9781848900660 / 184890066X
  • Weight 1.99 lbs (0.90 kg)
  • Dimensions 9.21 x 6.14 x 1.32 in (23.39 x 15.60 x 3.35 cm)
  • Themes
    • Aspects (Academic): Science/Technology Aspects
  • Category Computers - General Information
  • Dewey Decimal Code 511.3
  • Quantity available 1

About Cold Books New York, United States

Biblio member since 2012

Terms of Sale: 30 day return guarantee, with full refund including shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Cold Books

Reader reviews for The Lambda Calculus. Its Syntax and Semantics

From the publisher

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