An Introduction to Lambda Calculi for Computer Scientists [Paperback]

C Hankin (Author)

Book Description

ISBN-10: 0954300653 | ISBN-13: 978-0954300654 | Publication Date: February 2, 2004

The lambda-calculus lies at the very foundations of computer science. Besides its historical role in computability theory it has had significant influence on programming language design and implementation, denotational semantics, and domain theory. The book emphasises the proof theory for the type-free lambda-calculus. The first six chapters concern this calculus and cover the basic theory, reduction, models, computability, and the relationship between the lambda-calculus and combinatory logic. Chapter 7 presents a variety of typed calculi; first the simply typed lambda-calculus, then Milner-style polymorphism and, finally, the polymorphic lambda-calculus. Chapter 8 concerns two variants of the type-free lambda-calculus that have appeared in the research literature: the lazy lambda-calculus, and the lambda sigma-calculus. The final chapter contains references and a guide to further reading. There are exercises throughout. In contrast to earlier books on these topics, which were written by logicians, this book is written from a computer science perspective and emphasises the practical relevance of many of the key theoretical ideas. The book is intended as a course text for final year undergraduates or first year graduate students in computer science. Research students should find it a useful introduction to more specialist literature.

Product Details

• Paperback: 180 pages
• Publisher: College Publications (February 2, 2004)
• Language: English
• ISBN-10: 0954300653
• ISBN-13: 978-0954300654
• Product Dimensions: 8.8 x 5.9 x 0.5 inches
• Shipping Weight: 9.6 ounces (View shipping rates and policies)
• Average Customer Review: 2.9 out of 5 stars  See all reviews (7 customer reviews)
• Amazon Best Sellers Rank: #397,509 in Books (See Top 100 in Books)

More About the Author

Discover books, learn about writers, read author blogs, and more.

Customer Reviews

Most Helpful Customer Reviews

7 of 8 people found the following review helpful:

4.0 out of 5 stars Good introductory book, July 2, 2008

By 

W. Ghost (Brazil) - See all my reviews

Amazon Verified Purchase

This review is from: An Introduction to Lambda Calculi for Computer Scientists (Paperback)

This is a very nice book -- a good introduction to lambda Calculus, including some variations. The book is very short and doesn't cover too many things, and fits an undergraduate course where other subjects would be taught.
The text is clear and pleasant to read.

9 of 12 people found the following review helpful:

1.0 out of 5 stars Favours notation at the expense of clarity, November 4, 2008

By 

wooks "wookies" (uk) - See all my reviews

This review is from: An Introduction to Lambda Calculi for Computer Scientists (Paperback)

I could not get beyond the first chapter of Hankin's book.

I recommend instead Introduction to Functional Programming through Lambda Calculus which is very clear and features solutions to all exercises.

3.0 out of 5 stars Lacking but Adequate in Most Parts, December 9, 2010

By 

Customer (Baltimore) - See all my reviews

Amazon Verified Purchase

This review is from: An Introduction to Lambda Calculi for Computer Scientists (Paperback)

Before reading this book I had no introduction to the Lambda Calculus. This should give some context for my review. Also note that I did not study more than a single 400 level computability course in undergrad that was in addition to a mathematical logic course. Thus my exposure to programming and comp sci ideas is rather slim.

The scene being set, this book has given me a functional understanding of the core ideas behind the L-calculus. I looked at Berendregt a few months back and I would much prefer starting here; there is motivation and a leisurely pace that nevertheless remains within mathematical norms of formality and notation.

One negative of this book is that it skimps in detail and/or clarity in certain sections. E.g. the section on de Bruijn notation is not complete. In my view, there is not enough here for a novice to continue with a coherent picture. Some machines are built later using the notation, so there is at least one section that is worthless unless you look elsewhere to fill in the holes. Note, however, that one may supplement the de Bruijn section with free papers available online -- some very well written and great complements to Hankin. Just search under "Lambda Calculus tutorial" or something similar.

Another negative is the lack of good exercises; I don't have the book in front of me, but I believe some chapters have NO problems at all.

In sum, look at the Cambridge text on L-calculus and combinators. It is well rated and more complete. If I could go back I would've started there. If price is a concern then Hankin is probably your best option.

Incidentally, the one star reviews are not fair. E.g. It is hard to complain about the paper when this book is so cheap; the paper is perfectly good for introductory readings. If you want a reference text that will last forever this volume is not suitable in material and content, but nor does it claim to be.