{"product_id":"lambda-calculus-combinators-and-functional-programming-paperback-9780521114295","title":"Lambda-calculus, Combinators and Functional Programming (Paperback) 9780521114295","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eLambda-calculus, Combinators and Functional Programming\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cem\u003eProvides computer science students and researchers with a firm background in lambda-calculus and combinators.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eG. E. Revesz (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780521114295, Cambridge University Press\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003ePaperback, published 25 June 2009\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e192 pages\u003cbr\u003e24.4 x 17 x 1 cm, 0.32 kg\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\r\n\r\n\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eOriginally published in 1988, this book presents an introduction to lambda-calculus and combinators without getting lost in the details of mathematical aspects of their theory. Lambda-calculus is treated here as a functional language and its relevance to computer science is clearly demonstrated. The main purpose of the book is to provide computer science students and researchers with a firm background in lambda-calculus and combinators and show the applicabillity of these theories to functional programming. The presentation of the material is self-contained. It can be used as a primary text for a course on functional programming. It can also be used as a supplementary text for courses on the structure and implementation of programming languages, theory of computing, or semantics of programming languages.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003ePreface\u003cbr\u003e 1. Introduction\u003cbr\u003e 2. Type-free lambda-calculus\u003cbr\u003e 3. Combinators and constant symbols\u003cbr\u003e 4. List manipulation in lambda-calculus\u003cbr\u003e 5. Rule-based semantics of ?-expressions\u003cbr\u003e 6. Outlines of a reduction machine\u003cbr\u003e 7. Towards a parallel graph-reduction\u003cbr\u003e Appendix A: A proof of the Church-Rosser theorem\u003cbr\u003e Appendix B: Introduction to typed ?-calculus\u003cbr\u003e Bibliographical notes\u003cbr\u003e References.\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]\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":46006507077912,"sku":"9780521114295","price":48.59,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9780521114295i_7c07c1b4-c0a2-4b9d-be77-680ba7ab17ab.jpg?v=1691371329","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/lambda-calculus-combinators-and-functional-programming-paperback-9780521114295","provider":"Freshly Printed Books","version":"1.0","type":"link"}