Join Amazon Prime and get unlimited Free One-Day Delivery. Already a member? Sign in.
Perfect Partner
Customers Who Bought This Item Also Bought
Haskell Road to Logic, Maths and Programming, The (Texts in Computing S.) by Kees Doets  (2)
£13.51
|
Basic Category Theory for Computer Scientists (Foundations of Computing) by BC Pierce  (1)
£16.95
|
Beautiful Code: Leading Programmers Explain How They Think (Theory in Practice (O'Reilly)) by Andy Oram
£20.79
|
Programming Erlang: Software for a Concurrent World by Joe Armstrong (1)
£14.99
|
Programming in Haskell by Graham Hutton (1)
£22.79
|
Product details
Would you like to update product info or give feedback on images?
|
See all 2 customer reviews...
| Customers Viewing This Page May Be Interested in These Sponsored Links (What is this?) |
Lambda/Oxygen Sensors
www.emissioncontrols.co.uk
Genuine Bosch supplied only For prices call 0208 462 2543
Professional Printing
www.theprintspace.com
Silver-based digital C-Type & Giclee prints available. Buy Now
Join Wealthy Affiliate
www.wealthyaffiliate.com
Affiliate Marketing Dummie? Learn How To Become Wealthy!
Product Description
Synopsis
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.
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.