Lambda-Calculus and Combinators: An Introduction by J. Roger Hindley (English) H

Description: Lambda-Calculus and Combinators: An Introduction by J. Roger Hindley, Jonathan P. Seldin 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. FORMAT Hardcover LANGUAGE English CONDITION Brand New Publisher Description 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. Author Biography 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. Table of Contents Preface; 1. The -calculus; 2. Combinatory logic; 3. The power of and CL; 4. Computable functions; 5. Undecidability; 6. Formal theories; 7. Extensionality in -calculus; 8. Extensionality in CL; 9. Correspondence between and CL; 10. Simple typing, Church-style; 11. Simple typing, Curry-style in CL; 12. Simple typing, Curry-style in ; 13. Generalizations of typing; 14. Models of CL; 15. Models of ; 16. Scotts D and other models; Appendix 1. -conversion; Appendix 2. Confluence proofs; Appendix 3. Normalization proofs; Appendix 4. Care of your pet combinator; Appendix 5. Answers to starred exercises; Bibliography; Index. Review From reviews of the 1st 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 Review Quote 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 Promotional "Headline" This book gives an account of combinatory logic and lambda-calculus models. Description for Bookstore 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. Description for Library 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. Details ISBN0521898854 Author Jonathan P. Seldin Pages 345 Publisher Cambridge University Press Language English ISBN-10 0521898854 ISBN-13 9780521898850 Media Book Format Hardcover DEWEY 511.35 Illustrations Yes Year 2008 Publication Date 2008-07-31 Edition 2nd Imprint Cambridge University Press Subtitle An Introduction Place of Publication Cambridge Country of Publication United Kingdom Replaces 9780521268967 Short Title LAMBDA-CALCULUS & COMBINATORS Affiliation University of Lethbridge, Alberta DOI 10.1604/9780521898850 Audience Professional and Scholarly UK Release Date 2008-07-24 AU Release Date 2008-07-24 NZ Release Date 2008-07-24 We've got this At The Nile, if you're looking for it, we've got it. With fast shipping, low prices, friendly service and well over a million items - you're bound to find what you want, at a price you'll love! TheNile_Item_ID:91392927;

Price: 181.64 AUD

Location: Melbourne

End Time: 2025-01-06T03:41:34.000Z

Shipping Cost: 12.29 AUD