Term rewriting techniques are applicable in various fields of computer sci ence: in software engineering (e.g., equationally specified abstract data types), in programming languages (e.g., functional-logic programming), in computer algebra (e.g., symbolic computations, Grabner bases), in pro gram verification (e.g., automatically proving termination of programs), in automated theorem proving (e.g., equational unification), and in algebra (e.g., Boolean algebra, group theory). In other words, term rewriting has ...
Read More
Term rewriting techniques are applicable in various fields of computer sci ence: in software engineering (e.g., equationally specified abstract data types), in programming languages (e.g., functional-logic programming), in computer algebra (e.g., symbolic computations, Grabner bases), in pro gram verification (e.g., automatically proving termination of programs), in automated theorem proving (e.g., equational unification), and in algebra (e.g., Boolean algebra, group theory). In other words, term rewriting has applications in practical computer science, theoretical computer science, and mathematics. Roughly speaking, term rewriting techniques can suc cessfully be applied in areas that demand efficient methods for reasoning with equations. One of the major problems one encounters in the theory of term rewriting is the characterization of classes of rewrite systems that have a desirable property like confluence or termination. If a term rewriting system is conflu ent, then the normal form of a given term is unique. A terminating rewrite system does not permit infinite computations, that is, every computation starting from a term must end in a normal form. Therefore, in a system that is both terminating and confluent every computation leads to a result that is unique, regardless of the order in which the rewrite rules are applied. This book provides a comprehensive study of termination and confluence as well as related properties.
Read Less
Add this copy of Advanced Topics in Term Rewritin to cart. $49.64, new condition, Sold by discount_scientific_books rated 5.0 out of 5 stars, ships from Sterling Heights, MI, UNITED STATES, published 2002 by Springer.
Add this copy of Advanced Topics in Term Rewriting to cart. $51.65, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2010 by Springer-Verlag New York Inc..
Add this copy of Advanced Topics in Term Rewriting to cart. $51.65, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2002 by Springer.
Add this copy of Advanced Topics in Term Rewriting to cart. $54.06, new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2002 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Sewn binding. Cloth over boards. 414 p. Contains: Unspecified. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Advanced Topics in Term Rewriting to cart. $60.50, new condition, Sold by Media Smart rated 4.0 out of 5 stars, ships from Hawthorne, CA, UNITED STATES, published 2002 by Springer.
Add this copy of Advanced Topics in Term Rewriting (Hb 2002) to cart. $61.94, new condition, Sold by Books International rated 4.0 out of 5 stars, ships from Toronto, ON, CANADA, published 2002 by Springer.
Add this copy of Advanced Topics in Term Rewriting to cart. $71.22, new condition, Sold by Ria Christie Books rated 4.0 out of 5 stars, ships from Uxbridge, MIDDLESEX, UNITED KINGDOM, published 2010 by Springer-Verlag New York Inc..
