{"product_id":"lambda-calculus-with-types-hardback-9780521766142","title":"Lambda Calculus with Types (Hardback) 9780521766142","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eLambda Calculus with Types\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cem\u003eThis handbook with exercises reveals the mathematical beauty of formalisms hitherto mostly used for software and hardware design and verification.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eHenk Barendregt (Author), Wil Dekkers (Author), Richard Statman (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780521766142, Cambridge University Press\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 20 June 2013\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e856 pages, 52 b\/w illus.  300 exercises\u003cbr\u003e24.4 x 17 x 4.4 cm, 1.55 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'The authors have produced a well-written, organised and comprehensive account of three important type systems. These systems' properties have been rich sources of interest to logicians for many years; their problems are not all solved, and in future work this book will almost certainly become a standard reference about them. It will also allow the more mathematically inclined computer scientist to obtain a deeper understanding of the principles behind some of the higher order languages in current use.' Bulletin of the London Mathematical Society\u003c\/font\u003e\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eThis handbook with exercises reveals in formalisms, hitherto mainly used for hardware and software design and verification, unexpected mathematical beauty. The lambda calculus forms a prototype universal programming language, which in its untyped version is related to Lisp, and was treated in the first author's classic The Lambda Calculus (1984). The formalism has since been extended with types and used in functional programming (Haskell, Clean) and proof assistants (Coq, Isabelle, HOL), used in designing and verifying IT products and mathematical proofs.  In this book, the authors focus on three classes of typing for lambda terms: simple types, recursive types and intersection types. It is in these three formalisms of terms and types that the unexpected mathematical beauty is revealed. The treatment is authoritative and comprehensive, complemented by an exhaustive bibliography, and numerous exercises are provided to deepen the readers' understanding and increase their confidence using types.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eList of contributors\u003cbr\u003e Preface\u003cbr\u003e Introduction\u003cbr\u003e Part I. Simple Types: 1. The simply typed lambda calculus\u003cbr\u003e 2. Properties\u003cbr\u003e 3. Tools\u003cbr\u003e 4. Definability, unification and matching\u003cbr\u003e 5. Extensions\u003cbr\u003e 6. Applications\u003cbr\u003e Part II. Recursive Types: 7. The systems\u003cbr\u003e 8. Properties of recursive types\u003cbr\u003e 9. Properties of terms with types\u003cbr\u003e 10. Models\u003cbr\u003e 11. Applications\u003cbr\u003e Part III. Intersection Types: 12. An exemplary system\u003cbr\u003e 13. Type assignment systems\u003cbr\u003e 14. Basic properties\u003cbr\u003e 15. Type and lambda structures\u003cbr\u003e 16. Filter models\u003cbr\u003e 17. Advanced properties and applications\u003cbr\u003e Bibliography\u003cbr\u003e Symbol index\u003cbr\u003e Names index\u003cbr\u003e Definitions 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":46002868027672,"sku":"9780521766142","price":68.99,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9780521766142i_15cc2b81-1018-4222-9cd3-df818a9ceb5e.jpg?v=1691380873","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/lambda-calculus-with-types-hardback-9780521766142","provider":"Freshly Printed Books","version":"1.0","type":"link"}