Lambda-Calculus and Combinators: An Introduction (Hardcover)

J. Roger Hindley

ISBN 10: 0521898854 / ISBN 13: 9780521898850

Published by Cambridge University Press, Cambridge, 2008

About this Item

Hardcover. Combinatory logic and lambda-calculus, originally devised in the 1920s, 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 version is thoroughly revised and offers an 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. This book gives an account of combinatory logic and lambda-calculus. The grammar and basic properties of both systems are discussed, followed by explanations of type-theory and lambda-calculus models. The treatment is as non-technical as possible with many examples and exercises. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Seller Inventory # 9780521898850

Bibliographic Details

• Title: Lambda-Calculus and Combinators: An Introduction (Hardcover)
• Publisher: Cambridge University Press, Cambridge
• Publication Date: 2008
• Language: English
• ISBN 10: 0521898854
• ISBN 13: 9780521898850
• Binding: Hardcover
• Edition: 2nd Edition
• Condition: new

About this title

Synopsis

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.

About the Authors

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.

Jonathan P. Seldin is a Professor in the Department of Mathematics and Computer Science at the University of Lethbridge in Alberta, Canada.