Lambda-calculus, Combinators and Functional Programming
G. E. Revesz· ISBN 9780521114295
Special offer terms
Zookal Study Premium
Subscribe & save
By selecting the 'Susbcribe & Save' option you are enrolling in an auto-renewing subscription of Zookal Study Premium. Cancel at anytime.
Auto-Renewal
Your Zookal Study Premium subscription will be renewed each month until you cancel. You consent to Zookal automatically charging your payment method on file $19.99 each month after 1st month free period until you cancel.
How to Cancel
You can cancel your subscription anytime by visiting Manage account page, clicking "Manage subscription" and completing the steps to cancel. Cancellations take effect at the end of the 1st month free period (if applicable) or at the end of the current billing cycle in which your request to cancel was received. Subscription fees are not refundable.
Zookal Study Premium Monthly Subscription Includes:
Ability to post up to ten (10) questions per month.
20% off your textbooks order and free standard shipping whenever you shop online at
textbooks.zookal.com.au
Unused monthly subscription benefits have no cash value, are not transferable, and expire at the end of each month. This means that subscription benefits do not roll over to or accumulate for use in subsequent months.
Payment Methods
Afterpay and Zip Pay will not be available for purchases with Zookal Study Premium subscription added to bag.
$1.00 preauthorisation
You may see a $1.00 preauthorisation by your bank which will disappear from your statement in a few business days..
Email communications
By adding Zookal Study Premium, you agree to receive email communications from Zookal.
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.