{"product_id":"term-rewriting-systems-hardback-9780521391153","title":"Term Rewriting Systems (Hardback) 9780521391153","description":"\u003cfont face=\"Georgia\"\u003e\r\n\u003cp\u003e\u003cfont size=\"6\"\u003eTerm Rewriting Systems\u003c\/font\u003e\u003cbr\u003e\r\n\r\n\r\n\u003c\/p\u003e\n\u003cp\u003e\u003cem\u003eA comprehensive 2003 introduction to term rewriting for researchers. Features exercises, solutions and applications.\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\r\n\u003cp\u003e\u003cfont size=\"4\"\u003eTerese (Author)\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e9780521391153, Cambridge University Press\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003eHardback, published 20 March 2003\u003c\/font\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e908 pages, 273 b\/w illus.\u003cbr\u003e23.6 x 15.8 x 4.7 cm, 1.64 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'… it will soon be a compulsory reference for anyone working in the area.' Journal of Functional Programming\u003c\/font\u003e\u003c\/em\u003e\u003c\/p\u003e\r\n\r\n\u003cp align=\"justify\"\u003e\u003cstrong\u003e\u003cfont size=\"3\"\u003eTerm rewriting systems developed out of mathematical logic and are an important part of theoretical computer science. They consist of sequences of discrete transformation steps where one term is replaced with another and have applications in many areas, from functional programming to automatic theorem proving and computer algebra. This 2003 book starts at an elementary level with the earlier chapters providing a foundation for the rest of the work. Much of the advanced material appeared here for the first time in book form. Subjects treated include orthogonality, termination, completion, lambda calculus, higher-order rewriting, infinitary rewriting and term graph rewriting. Many exercises are included with selected solutions provided on the web. A comprehensive bibliography makes this book ideal both for teaching and research. A chapter is included presenting applications of term rewriting systems, with many pointers to actual implementations.\u003c\/font\u003e\u003c\/strong\u003e\u003c\/p\u003e\r\n\r\n\u003cp\u003e\u003cfont size=\"3\"\u003e1. Abstract reduction systems\u003cbr\u003e 2. First-order term rewriting systems\u003cbr\u003e 3. Examples of TRSs and special rewriting formats\u003cbr\u003e 4. Orthogonality\u003cbr\u003e 5. Properties of rewriting: decidability and modularity\u003cbr\u003e 6. Termination\u003cbr\u003e 7. Completion of equational specifications\u003cbr\u003e 8. Equivalence of reductions\u003cbr\u003e 9. Strategies\u003cbr\u003e 10. Lambda calculus\u003cbr\u003e 11. Higher order rewriting\u003cbr\u003e 12. Infinitary rewriting\u003cbr\u003e 13. Term graph rewriting\u003cbr\u003e 14. Advanced ARS theory\u003cbr\u003e 15. Rewriting based languages and systems\u003cbr\u003e 16. Mathematical background.\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":46004597817624,"sku":"9780521391153","price":198.39,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0730\/2037\/5320\/products\/9780521391153i_998ebaf9-056f-4c64-8219-61c205627329.jpg?v=1691376262","url":"https:\/\/freshlyprintedbooks.co.uk\/products\/term-rewriting-systems-hardback-9780521391153","provider":"Freshly Printed Books","version":"1.0","type":"link"}