Rewriting Techniques Applications Dijon (4 results)
- Softcover
Seller: Zubal-Books, Since 1961, Cleveland, OH, U.S.A.Zubal-Books, Since 1961
Contact seller5-star sellerCondition: Used - Good
US$ 46.35
US$ 4.50 shippingShips within U.S.A.Quantity: 1 available
Condition: Good. *Price HAS BEEN REDUCED by 10% until Monday, August 17 (SALE item)* 440 pp., Paperback, ex library, else text clean and binding tight. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional du…ties, taxes, or fees required by recipient's country.
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
US$ 57.78
US$ 16.16 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Softcover
Seller: Chiron Media, Wallingford, United KingdomChiron Media
Contact seller5-star sellerCondition: New
US$ 53.58
US$ 20.90 shippingShips from United Kingdom to U.S.A.Quantity: 10 available
PF. Condition: New.
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 101.51
US$ 73.13 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: Neu. Neuware - Basic features and development of the critical-pair/completion procedure.- Contextual rewriting.- Thue systems as rewriting systems.- Deciding algebraic properties of monoids presented by finite church-rosser Thue systems.- Two applications of equational theories to database theory.- An exp…eriment in partial evaluation: The generation of a compiler generator.- NARROWER: a new algorithm for unification and its application to Logic Programming.- Solving type equations by graph rewriting.- Termination.- Path of subterms ordering and recursive decomposition ordering revisited.- Associative path orderings.- A procedure for automatically proving the termination of a set of rewrite rules.- Petrireve: Proving Petri net properties with rewriting systems.- Fairness in term rewriting systems.- Two results in term rewriting theorem proving.- Handling function definitions through innermost superposition and rewriting.- An ideal-theoretic approach to word problems and unification problems over finitely presented commutative algebras.- Combining unification algorithms for confined regular equational theories.- An algebraic approach to unification under associativity and commutativity.- Unification problems with one-sided distributivity.- Fast many-to-one matching algorithms.- Complexity of matching problems.- The set of unifiers in typed -calculus as regular expression.- Equational systems for category theory and intuitionistic logic.
