The Testaments out now
Lambda-Calculus and Combinators: An Introduction (Hardback)
  • Lambda-Calculus and Combinators: An Introduction (Hardback)

Lambda-Calculus and Combinators: An Introduction (Hardback)

(author), (author)
Hardback 358 Pages / Published: 24/07/2008
  • We can order this

Usually dispatched within 2 weeks

  • This item has been added to your basket
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.

Publisher: Cambridge University Press
ISBN: 9780521898850
Number of pages: 358
Weight: 610 g
Dimensions: 235 x 154 x 23 mm
Edition: 2nd Revised edition

From reviews of the first edition: 'The book of R. Hindley and J. Seldin is a very good introduction to fundamental techniques and results in these fields ... the book is clear, pleasant to read, and it needs no previous knowledge in the domain, but only basic notions of mathematical logic ... Clearly, it was impossible to treat everything in detail; but even when a subject is only skimmed, the book always provides an incentive for going deeper, and furnishes the means to do it, owing to a substantial bibliography. Several chapters end with interesting and useful notes with history, comments, and indications for further reading ... In conclusion, this book is very interesting and well written, and is highly recommended to everyone who wants to approach combinatory logic and lambda-calculus (logicians or computer scientists). J. Symbolic Logic
'The best general book on lambda-calculus (typed or untyped) and the theory of combinators.' Gerard Huet, INRIA
'... for teaching and for research or self-study the book is an outstanding source with its own clear merits. I think this second edition of this classical book is a beautiful asset for the literature on -calculus and CL.' Theory and Practice of Logic Programming
'... well written and offers a broad coverage backed by an extensive list of references. It could serve as an excellent study material for classes on -calculus and CL as well as a reference for logicians and computer scientists interested in the formal background for functional programming and related areas.' EMS Newsletter
'Without doubt this is a valuable treatment of a venerable topic that rewards those who understand it. The authors successfully promulgate their tradition, and that is certainly more important than providing full proofs for every result.' The Journal of JFP

You may also be interested in...

Foundation Mathematics for Biosciences
Added to basket
Alan Turing's Systems of Logic
Added to basket
Set Theory and its Philosophy
Added to basket
Equation That Couldn't be Solved
Added to basket
How to Prove It
Added to basket
Measurements and their Uncertainties
Added to basket
Logic For Dummies
Added to basket
Added to basket
The Foundations of Mathematics
Added to basket
Godel's Proof
Added to basket

Please sign in to write a review

Your review has been submitted successfully.