{"product_id":"lambda-calculus-and-combinators-an-introduction-hardback-9780521898850","title":"Lambda-Calculus and Combinators; An Introduction (Hardback) 9780521898850","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eLambda-Calculus and Combinators\u003c\/font\u003e\u003cbr\u003e\r\n\u003cfont size=\"5\"\u003eAn Introduction\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cem\u003eThis book gives an account of combinatory logic and lambda-calculus models.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eJ. Roger Hindley (Author), Jonathan P. Seldin (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780521898850, Cambridge University Press\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 24 July 2008\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e358 pages, 10 b\/w illus.  1 table  55 exercises\u003cbr\u003e23.5 x 15.4 x 2.3 cm, 0.61 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cem\u003e\u003cfont size=\"3\"\u003e'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\u003c\/font\u003e\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eCombinatory 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.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003ePreface\u003cbr\u003e 1. The ?-calculus\u003cbr\u003e 2. Combinatory logic\u003cbr\u003e 3. The power of ? and CL\u003cbr\u003e 4. Computable functions\u003cbr\u003e 5. Undecidability\u003cbr\u003e 6. Formal theories\u003cbr\u003e 7. Extensionality in ?-calculus\u003cbr\u003e 8. Extensionality in CL\u003cbr\u003e 9. Correspondence between ? and CL\u003cbr\u003e 10. Simple typing, Church-style\u003cbr\u003e 11. Simple typing, Curry-style in CL\u003cbr\u003e 12. Simple typing, Curry-style in ?\u003cbr\u003e 13. Generalizations of typing\u003cbr\u003e 14. Models of CL\u003cbr\u003e 15. Models of ? \u003cbr\u003e 16. Scott's D? and other models\u003cbr\u003e Appendix 1. ?-conversion\u003cbr\u003e Appendix 2. Confluence proofs\u003cbr\u003e Appendix 3. Normalization proofs\u003cbr\u003e Appendix 4. Care of your pet combinator\u003cbr\u003e Appendix 5. Answers to starred exercises\u003cbr\u003e Bibliography\u003cbr\u003e Index.\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eSubject Areas: Mathematical theory of computation [\u003ca title=\"See our other books on Mathematical theory of computation\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20theory%20of%20computation%20%5BUYA%5D%22\"\u003eUYA\u003c\/a\u003e], Mathematical logic [\u003ca title=\"See our other books on Mathematical logic\" href=\"https:\/\/freshlyprintedbooks.co.uk\/search?q=%22Mathematical%20logic%20%5BPBCD%5D%22\"\u003ePBCD\u003c\/a\u003e]\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003c\/font\u003e","brand":"Cambridge University Press","offers":[{"title":"Default Title","offer_id":46002972033304,"sku":"9780521898850","price":60.39,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9780521898850i_467e83e5-f702-47d7-bcbb-ea80c7a8eafa.jpg?v=1691359172","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/lambda-calculus-and-combinators-an-introduction-hardback-9780521898850","provider":"Freshly Printed Books","version":"1.0","type":"link"}