Term Rewriting Systems (Cambridge Tracts in Theoretical Computer Science, Series Number 55) - Hardcover
Synopsis
Term rewriting systems, which developed out of mathematical logic, consist of sequences of discrete steps where one term is replaced with another. Their many applications range from automatic theorem proving systems to computer algebra. This book begins with several examples, followed by a chapter on basic notions that provides a foundation for the rest of the work. First-order and higher-order theories are presented, with much of the latter material appearing for the first time in book form. Subjects treated include orthogonality, termination, lambda calculus and term graph rewriting. There is also a chapter detailing the required mathematical background.
"synopsis" may belong to another edition of this title.
Book Description
Term rewriting systems have greatly influenced theoretical computer science. Such systems consist of sequences of discrete steps where one term is replaced with another, and thus have applications in many areas, from automatic theorem proving systems to computer algebra. The early introductory chapters are followed by higher level material, much of which appears here for the first time in book form. Many exercises are included, with selected solutions, and there is a comprehensive bibliography, making the book ideal both for teaching and for research.
Review
"My recommendation is that anyone interested in rewriting needs this book."
Frederic Loulergue for SIGACT News
"About this title" may belong to another edition of this title.
Search results for Term Rewriting Systems (Cambridge Tracts in Theoretical...
Stock Image
Term Rewriting Systems
Published by
Cambridge University Press, 2003
ISBN 10: 0521391156
ISBN 13: 9780521391153
Used
Hardcover
Seller: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: Good. No Jacket. Missing dust jacket; Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less. Seller Inventory # G0521391156I3N01
Stock Image
Term Rewriting Systems (Cambridge Tracts in Theoretical Computer Science, Series Number 55)
Published by
Cambridge University Press, 2003
ISBN 10: 0521391156
ISBN 13: 9780521391153
New
Hardcover
Seller: Best Price, Torrance, CA, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. SUPER FAST SHIPPING. Seller Inventory # 9780521391153
Stock Image
Term Rewriting Systems (Cambridge Tracts in Theoretical Computer Science, Series Number 55)
Published by
Cambridge University Press, 2003
ISBN 10: 0521391156
ISBN 13: 9780521391153
New
Hardcover
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Feb2416190001411
Stock Image
Term Rewriting Systems (Cambridge Tracts in Theoretical Computer Science, Series Number 55)
Published by
Cambridge University Press, 2003
ISBN 10: 0521391156
ISBN 13: 9780521391153
New
Hardcover
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9780521391153_new
Buy New
US$ 291.73
Shipping:
US$ 15.86
From United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
Term Rewriting Systems (Hardcover)
Published by
Cambridge University Press, Cambridge, 2003
ISBN 10: 0521391156
ISBN 13: 9780521391153
New
Hardcover
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: new. Hardcover. Term 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 book starts at an elementary level with the earlier chapters providing a foundation for the rest of the work. Much of the advanced material appears 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. Term rewriting systems, which developed out of mathematical logic, consist of sequences of discrete steps where one term is replaced with another. Their many applications range from automatic theorem proving systems to computer algebra. This book begins with several examples, followed by a chapter on basic notions that provides a foundation for the rest of the work. First-order and higher-order theories are presented, with much of the latter material appearing for the first time in book form. Subjects treated include orthogonality, termination, lambda calculus and term graph rewriting. There is also a chapter detailing the required mathematical background. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780521391153
Stock Image
Term Rewriting Systems
Print on DemandSeller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: Brand New. 680 pages. 9.50x6.25x1.75 inches. In Stock. This item is printed on demand. Seller Inventory # __0521391156
Buy New
US$ 309.37
Shipping:
US$ 26.48
From United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Term Rewriting Systems (Hardcover)
Published by
Cambridge University Press, Cambridge, 2003
ISBN 10: 0521391156
ISBN 13: 9780521391153
New
Hardcover
Seller: CitiRetail, Stevenage, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: new. Hardcover. Term 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 book starts at an elementary level with the earlier chapters providing a foundation for the rest of the work. Much of the advanced material appears 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. Term rewriting systems, which developed out of mathematical logic, consist of sequences of discrete steps where one term is replaced with another. Their many applications range from automatic theorem proving systems to computer algebra. This book begins with several examples, followed by a chapter on basic notions that provides a foundation for the rest of the work. First-order and higher-order theories are presented, with much of the latter material appearing for the first time in book form. Subjects treated include orthogonality, termination, lambda calculus and term graph rewriting. There is also a chapter detailing the required mathematical background. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9780521391153
Buy New
US$ 308.88
Shipping:
US$ 48.99
From United Kingdom to U.S.A.
Quantity: 1 available
Seller Image
Term Rewriting Systems
Published by
Cambridge University Press, 2011
ISBN 10: 0521391156
ISBN 13: 9780521391153
New
Hardcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Gebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. A comprehensive 2003 treatment of term rewriting systems from an elementary to an advanced level. Much of this material appeared here for the first time in book form. Ideal for teaching or research, it features numerous exercises with selected solutions on . Seller Inventory # 446933901
Buy New
US$ 314.65
Shipping:
US$ 56.83
From Germany to U.S.A.
Quantity: Over 20 available
Stock Image
Term Rewriting Systems (Hardcover)
Published by
Cambridge University Press, Cambridge, 2003
ISBN 10: 0521391156
ISBN 13: 9780521391153
New
Hardcover
Seller: AussieBookSeller, Truganina, VIC, Australia
Seller rating 5 out of 5 stars
Hardcover. Condition: new. Hardcover. Term 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 book starts at an elementary level with the earlier chapters providing a foundation for the rest of the work. Much of the advanced material appears 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. Term rewriting systems, which developed out of mathematical logic, consist of sequences of discrete steps where one term is replaced with another. Their many applications range from automatic theorem proving systems to computer algebra. This book begins with several examples, followed by a chapter on basic notions that provides a foundation for the rest of the work. First-order and higher-order theories are presented, with much of the latter material appearing for the first time in book form. Subjects treated include orthogonality, termination, lambda calculus and term graph rewriting. There is also a chapter detailing the required mathematical background. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Seller Inventory # 9780521391153
Stock Image
Term Rewriting Systems
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: Brand New. 680 pages. 9.50x6.25x1.75 inches. In Stock. Seller Inventory # x-0521391156
Buy New
US$ 418.50
Shipping:
US$ 26.48
From United Kingdom to U.S.A.
Quantity: 2 available