Lambda-Calculus and Combinators: An Introduction Contributor(s): Hindley, J. Roger (Author), Seldin, Jonathan P. (Author) |
|
![]() |
ISBN: 0521898854 ISBN-13: 9780521898850 Publisher: Cambridge University Press OUR PRICE: $80.74 Product Type: Hardcover - Other Formats Published: August 2008 |
Additional Information |
BISAC Categories: - Mathematics | Logic - Computers | Programming Languages - General |
Dewey: 511.35 |
LCCN: 2008006276 |
Physical Information: 0.9" H x 5.9" W x 9" (1.40 lbs) 358 pages |
Descriptions, Reviews, Etc. |
Publisher Description: Combinatory logic and lambda-calculus, originally devised in the 1920's, have since developed into linguistic tools, especially useful in programming languages. The authors' previous book served as the main reference for introductory courses on lambda-calculus for over 20 years: this long-awaited new version is thoroughly revised and offers a fully up-to-date account of the subject, with the same authoritative exposition. The grammar and basic properties of both combinatory logic and lambda-calculus are discussed, followed by an introduction to type-theory. Typed and untyped versions of the systems, and their differences, are covered. Lambda-calculus models, which lie behind much of the semantics of programming languages, are also explained in depth. The treatment is as non-technical as possible, with the main ideas emphasized and illustrated by examples. Many exercises are included, from routine to advanced, with solutions to most at the end of the book. |
Contributor Bio(s): Hindley, J. Roger: - J. Roger Hindley is an Honorary Research Fellow at Swansea University, Wales. His main research interests are Lambda-calculus and combinatory logic and he has taught at many international universities including Bristol University, Pennsylvania State University and Tokyo Institute of technology. This is his 7th book.Seldin, Jonathan P.: - Jonathan P. Seldin is a Professor in the Department of Mathematics and Computer Science at the University of Lethbridge in Alberta, Canada. |