Skip to content
Open global navigation

Cambridge University Press

AcademicLocation selectorSearch toggleMain navigation toggle
Cart
Register Sign in Wishlist

Lambda-calculus, Combinators and Functional Programming

$52.00

Part of Cambridge Tracts in Theoretical Computer Science

  • Date Published: June 2009
  • availability: Available
  • format: Paperback
  • isbn: 9780521114295

$52.00
Paperback

Add to cart Add to wishlist

Other available formats:
Hardback


Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • 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.

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: June 2009
    • format: Paperback
    • isbn: 9780521114295
    • length: 192 pages
    • dimensions: 244 x 170 x 10 mm
    • weight: 0.32kg
    • availability: Available
  • Table of Contents

    Preface
    1. Introduction
    2. Type-free lambda-calculus
    3. Combinators and constant symbols
    4. List manipulation in lambda-calculus
    5. Rule-based semantics of λ-expressions
    6. Outlines of a reduction machine
    7. Towards a parallel graph-reduction
    Appendix A: A proof of the Church-Rosser theorem
    Appendix B: Introduction to typed λ-calculus
    Bibliographical notes
    References.

  • Author

    G. E. Revesz

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email cflack@cambridge.org

Register Sign in
Please note that an additional password is required to open the solutions file once you have downloaded it. Contact collegesales@cambridge.org for this password.

» Proceed

You are now leaving the Cambridge University Press website, your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Find content that relates to you

© Cambridge University Press 2014

Back to top

Are you sure you want to delete your account?

This cannot be undone.

Cancel Delete

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×