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.' Gérard 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
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.