rent-now

Rent More, Save More! Use code: ECRENTAL

5% off 1 book, 7% off 2 books, 10% off 3+ books

9780521114295

Lambda-calculus, Combinators and Functional Programming

by
  • ISBN13:

    9780521114295

  • ISBN10:

    0521114292

  • Edition: 1st
  • Format: Paperback
  • Copyright: 2009-06-25
  • Publisher: Cambridge University Press

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping Icon Free Shipping On Orders Over $35!
    Your order must be $35 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • eCampus.com Logo Get Rewarded for Ordering Your Textbooks! Enroll Now
  • Write a Review Icon Write a Review
List Price: $68.00 Save up to $22.10
  • Rent Book $45.90
    Add to Cart Free Shipping Icon Free Shipping

    TERM
    PRICE
    DUE
    SPECIAL ORDER: 1-2 WEEKS
    *This item is part of an exclusive publisher rental program and requires an additional convenience fee. This fee will be reflected in the shopping cart.

How To: Textbook Rental

Looking to rent a book? Rent Lambda-calculus, Combinators and Functional Programming [ISBN: 9780521114295] for the semester, quarter, and short term or search our site for other textbooks by G. E. Revesz. Renting a textbook can save you up to 90% from the cost of buying.

Summary

Originally published in 1988, this book presents an introduction to lambda-calculus and combinators without getting lost in the details of mathematical aspects of their theory. Lambda-calculus is treated here as a functional language and its relevance to computer science is clearly demonstrated. The main purpose of the book is to provide computer science students and researchers with a firm background in lambda-calculus and combinators and show the applicabillity of these theories to functional programming. The presentation of the material is self-contained. It can be used as a primary text for a course on functional programming. It can also be used as a supplementary text for courses on the structure and implementation of programming languages, theory of computing, or semantics of programming languages.

Table of Contents

Preface
Introduction
Type-free lambda-calculus
Combinators and constant symbols
List manipulation in lambda-calculus
Rule-based semantics of Δ-expressions
Outlines of a reduction machine
Towards a parallel graph-reduction
A proof of the Church-Rosser theorem
Introduction to typed Δ-calculus
Bibliographical notes
References
Table of Contents provided by Publisher. All Rights Reserved.

Supplemental Materials

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Rewards Program