- Paperback: 180 pages
- Publisher: King's College Publications (5 Feb 2004)
- Language English
- ISBN-10: 0954300653
- ISBN-13: 978-0954300654
- Product Dimensions: 22.4 x 15 x 1.3 cm
- Average Customer Review: 2.0 out of 5 stars See all reviews (2 customer reviews)
- Amazon Bestsellers Rank: 557,064 in Books (See Top 100 in Books)
Did you know you can trade in your old books for an Amazon.co.uk Gift Card to spend on the things you want? Visit the Amazon.co.uk Trade-In Store for more details. |
Product details |
More About the Author
Product Description
Product Description
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.
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
Sell a Digital Version of This Book in the Kindle Store
If you are a publisher or author and hold the digital rights to a book, you can sell a digital version of it in our Kindle Store.
Learn more
What Other Items Do Customers Buy After Viewing This Item?
Customer Reviews
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
1 of 1 people found the following review helpful:
3.0 out of 5 stars
All definition, hollow explanation,
By Lloyd Moore "Lloyd" (Alicante, Spain) - See all my reviews
This review is from: An Introduction to Lambda Calculi for Computer Scientists (Paperback)
Although I found this book to be good to refer to after learning the material elsewhere, on reflection I found the explanations of important concepts, such as n reduction differences between normal and applicative order, to be lacking somewhat in content. The material is classsically presented, although I feel that a book to be read outside the classroom should offer maybe more of a helping hand.
0 of 7 people found the following review helpful:
1.0 out of 5 stars
Ugh!!!!,
By
This review is from: An Introduction to Lambda Calculi for Computer Scientists (Paperback)
The author chooses to express his ideas in the most opaque obnoxious notation. Maybe it is a good book, but I don't agree that the choice of notation appropriate for computer scientists and if you don't get to grips with the way the author expresses himself anything out of the book.
Share your thoughts with other customers: Create your own review
Most Helpful Customer Reviews on Amazon.com (beta) Amazon.com:
3.0 out of 5 stars (8 customer reviews) 7 of 9 people found the following review helpful:
4.0 out of 5 stars
Good introductory book,
By W. Ghost - Published on Amazon.com
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 13 people found the following review helpful:
1.0 out of 5 stars
Favours notation at the expense of clarity,
By wooks "wookies" - Published on Amazon.com
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.
5.0 out of 5 stars
Nice introduction to lambda calculus,
By Ilya - Published on Amazon.com
This review is from: An Introduction to Lambda Calculi for Computer Scientists (Paperback)
This is a nice introduction to lambda calculus, combinatory logic and the like topics. It is based on Hankin's undergraduate course at Imperial College London. It is not self-contained; there are many references to the more comprehensive (and much more expensive) textbooks by Barendregt and by Hindley and Seldin. I wish I had read it in college.
|
|
Listmania!
Look for similar items by category
Look for similar items by subject
Feedback
- Would you like to update product info or give feedback on images?
- I am the Author, and I want to comment on my book.
- I am the Publisher, and I want to comment on this book.
|
