Rewriting techniques applications dijon (6 risultati)

- Brossura
Da: Zubal-Books, Since 1961, Cleveland, OH, U.S.A.Zubal-Books, Since 1961
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Buono
EUR 55,61
EUR 4,01 spedizioneSpedito in U.S.A.Quantità: 1 disponibile
Condizione: Good. 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 duties, taxes, or fees required by recipient's country.…

- Brossura
Da: Ria Christie Collections, Uxbridge, Regno UnitoRia Christie Collections
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 55,97
EUR 13,40 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. In English.

- Brossura
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Usato - Come nuovo
EUR 69,50
EUR 2,35 spedizioneSpedito in U.S.A.Quantità: 15 disponibili
Condizione: As New. Unread book in perfect condition.

- Brossura
Da: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 71,24
EUR 2,35 spedizioneSpedito in U.S.A.Quantità: 15 disponibili
Condizione: New.

- Brossura
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 93,76
EUR 35,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibile
Taschenbuch. Condizione: 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 experiment 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.…

- Brossura
- Print on Demand
Da: Chiron Media, Wallingford, Regno UnitoChiron Media
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 47,14
EUR 7,70 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 20 disponibili
PF. Condizione: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.