C HankinRelease Date: 01 February 2004
Format: Paperback / softback
Pages: 180
Category:
Computer ScienceISBN: 9780954300654
ISBN10: 0954300653
The lambdacalculus 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 typefree lambdacalculus. The first six chapters concern this calculus and cover the basic theory, reduction, models, computability, and the relationship between the lambdacalculus and combinatory logic. Chapter 7 presents a variety of typed calculi; first the simply typed lambdacalculus, then Milnerstyle polymorphism and, finally, the polymorphic lambdacalculus. Chapter 8 concerns two variants of the typefree lambdacalculus that have appeared in the research literature: the lazy lambdacalculus, and the lambda sigmacalculus. 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.
AUD $37.95
This title is not held in stock & is ordered from suppliers, subject to availability.
View other C Hankin titles like "An Introduction to Lambda Calculi for Computer Scientists"
Write a customer review of An Introduction to Lambda Calculi for Computer Scientists.
If you like this title please tell others:
Australian Bookshop. Established 2003 



