{"product_id":"basic-simple-type-theory-hardback-9780521465182","title":"Basic Simple Type Theory (Hardback) 9780521465182","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eBasic Simple Type Theory\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cem\u003eAn introduction to type theory for computer scientists.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eJ. Roger Hindley (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780521465182, Cambridge University Press\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 31 July 1997\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e200 pages, 10 b\/w illus.  1 table\u003cbr\u003e23.6 x 15.7 x 1.5 cm, 0.45 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cem\u003e\u003cfont size=\"3\"\u003eThe proofs in this book are given in great detail, and still the author succeeds in writing the book in a clear but not too technical style.  It is easy and pleasurable to read this book.\"   Journal of Symbolic Logic\u003c\/font\u003e\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eType theory is one of the most important tools in the design of higher-level programming languages, such as ML. This book introduces and teaches its techniques by focusing on one particularly neat system and studying it in detail. In this way, all the key ideas are covered without getting involved in the complications of more advanced systems, but concentrating rather on the principles that make the theory work in practice. This book takes a type-assignment approach to type theory, and the system considered is the simplest  polymorphic one. The author covers all the basic ideas, including the system's relation to propositional logic, and gives a careful treatment of the type-checking algorithm which lies at the heart of every such system. Also featured are two other interesting algorithms that have been buried in inaccessible technical literature. The mathematical presentation is rigorous but clear, making the book at a level which can be used as an introduction to type theory for computer scientists.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eIntroduction\u003cbr\u003e 1. The type-free ?-calculus\u003cbr\u003e 2. Assigning types to terms\u003cbr\u003e 3. The principal-type algorithm\u003cbr\u003e 4. Type assignment with equality\u003cbr\u003e 5. A version using typed terms\u003cbr\u003e 6. The correspondence with implication\u003cbr\u003e 7. The converse principal-type algorithm\u003cbr\u003e 8. Counting a type's inhabitants\u003cbr\u003e 9. Technical details\u003cbr\u003e Answers to starred exercises\u003cbr\u003e Bibliography\u003cbr\u003e Table of principal types\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":46007601561880,"sku":"9780521465182","price":100.99,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9780521465182i_5787b36c-7ea1-4deb-b8a6-0d49beeeaf5d.jpg?v=1691382517","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/basic-simple-type-theory-hardback-9780521465182","provider":"Freshly Printed Books","version":"1.0","type":"link"}