Skip to content
Open global navigation

Cambridge University Press

AcademicLocation selectorSearch toggleMain navigation toggle
Cart
Register Sign in Wishlist

Lambda-Calculus and Combinators
An Introduction

2nd Edition

$81.00 (Z)

textbook
  • Date Published: August 2008
  • availability: Available, despatch within 1-2 weeks
  • format: Hardback
  • isbn: 9780521898850

$81.00 (Z)
Hardback

Add to cart Add to wishlist

Other available formats:
eBook


Looking for an examination copy?

This title is not currently available for examination. However, 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
About the Authors
  • Combinatory logic and lambda-calculus, originally devised in the 1920’s, have since developed into linguistic tools, especially useful in programming languages. The authors’ previous book served as the main reference for introductory courses on lambda-calculus for over 20 years: this long-awaited new version is thoroughly revised and offers a fully up-to-date account of the subject, with the same authoritative exposition. The grammar and basic properties of both combinatory logic and lambda-calculus are discussed, followed by an introduction to type-theory. Typed and untyped versions of the systems, and their differences, are covered. Lambda-calculus models, which lie behind much of the semantics of programming languages, are also explained in depth. The treatment is as non-technical as possible, with the main ideas emphasized and illustrated by examples. Many exercises are included, from routine to advanced, with solutions to most at the end of the book.

    • The authors' 1986 version of this book is widely recognised as the best introduction to these topics for the reader with some previous experience of logic; this version builds and updates that framework
    • Accessible and clear: a non-technical treatment of the subject with the main ideas emphasized and illustrated by examples
    • Exercises are designed to give practice to beginners and range from elementary to advanced, with solutions to most found at the end of the book
    Read more

    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

    • Edition: 2nd Edition
    • Date Published: August 2008
    • format: Hardback
    • isbn: 9780521898850
    • length: 358 pages
    • dimensions: 229 x 152 x 24 mm
    • weight: 0.7kg
    • contains: 10 b/w illus. 1 table 55 exercises
    • availability: Available, despatch within 1-2 weeks
  • Table of Contents

    Preface
    1. The λ-calculus
    2. Combinatory logic
    3. The power of λ and CL
    4. Computable functions
    5. Undecidability
    6. Formal theories
    7. Extensionality in λ-calculus
    8. Extensionality in CL
    9. Correspondence between λ and CL
    10. Simple typing, Church-style
    11. Simple typing, Curry-style in CL
    12. Simple typing, Curry-style in λ
    13. Generalizations of typing
    14. Models of CL
    15. Models of λ
    16. Scott's D∞ and other models
    Appendix 1. α-conversion
    Appendix 2. Confluence proofs
    Appendix 3. Normalization proofs
    Appendix 4. Care of your pet combinator
    Appendix 5. Answers to starred exercises
    Bibliography
    Index.

  • general resources

    View all resources
    Group Section Name Type Size Sort Order filter vars
    General ResourcesAuthors' web pagelinkn/aSort Order general resources general resources general resources general resources

    These resources are provided free of charge by Cambridge University Press with permission of the author of the corresponding work, but are subject to copyright. You are permitted to view, print and download these resources for your own personal use only, provided any copyright lines on the resources are not removed or altered in any way. Any other use, including but not limited to distribution of the resources in modified form, or via electronic or other media, is strictly prohibited unless you have permission from the author of the corresponding work and provided you give appropriate acknowledgement of the source.

    If you are having problems accessing these resources please email cflack@cambridge.org

  • Authors

    J. Roger Hindley, University of Wales, Swansea
    J. Roger Hindley is an Honorary Research Fellow at Swansea University, Wales. His main research interests are Lambda-calculus and combinatory logic and he has taught at many international universities including Bristol University, Pennsylvania State University and Tokyo Institute of technology. This is his 7th book.

    Jonathan P. Seldin, University of Lethbridge, Alberta
    Jonathan P. Seldin is a Professor in the Department of Mathematics and Computer Science at the University of Lethbridge in Alberta, Canada.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

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

Join us online

© 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.
×