Librería: GuthrieBooks, Spring Branch, TX, Estados Unidos de America
EUR 34,86
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Very Good. 0387531629 Ex-library paperback in very nice condition with the usual markings and attachments.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 60,57
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Chiron Media, Wallingford, Reino Unido
EUR 57,14
Cantidad disponible: 10 disponibles
Añadir al carritoPF. Condición: New.
Idioma: Inglés
Publicado por Springer-Verlag Berlin and Heidelberg GmbH and Co. KG, DE, 1990
ISBN 10: 3540531629 ISBN 13: 9783540531623
Librería: Rarewaves.com USA, London, LONDO, Reino Unido
EUR 77,14
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: New. 1990 ed.
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 53,49
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Proving and rewriting.- Proving correctness w.r.t. specifications with hidden parts.- Hybrid implementations of algebraic specifications.- Multi-modal logic programming using equational and order-sorted logic.- Logic programs with equational type specifications.- Higher-order order-sorted algebras.- Axiomatization of a functional logic language.- Fourier algorithm revisited.- Fixpoint techniques for non-monotone maps.- Domain theory for nonmonotonic functions.- On the strong completion of logic programs.- An equivalence preserving first order unfold/fold transformation system.- Propositional calculus problems in CHIP.- Unfolding and fixpoint semantics of concurrent constraint logic programs.- Eliminating negation from normal logic programs.- On logic programming interpretations of Dislog: Programming long-distance dependencies in logic.- Recursive query processing in predicate-goal graph.- Implementation of completion by transition rules + control: ORME.- A matching process modulo a theory of categorical products.- Equation solving in conditional AC-theories.- Lazy narrowing in a graph machine.- An abstract concurrent machine for rewriting.- Applying term rewriting methods to finite groups.- Termination proofs by multiset path orderings imply primitive recursive derivation lengths.- Optimization of rewriting and complexity of rewriting.- AC-Termination of rewrite systems: A modified Knuth-Bendix ordering.
Librería: Rarewaves.com UK, London, Reino Unido
EUR 62,99
Cantidad disponible: Más de 20 disponibles
Añadir al carritoPaperback. Condición: New. 1990th.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg, 1990
ISBN 10: 3540531629 ISBN 13: 9783540531623
Librería: moluna, Greven, Alemania
EUR 48,37
Cantidad disponible: Más de 20 disponibles
Añadir al carritoKartoniert / Broschiert. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Proving and rewriting.- Proving correctness w.r.t. specifications with hidden parts.- Hybrid implementations of algebraic specifications.- Multi-modal logic programming using equational and order-sorted logic.- Logic programs with equational type specificat.
Idioma: Inglés
Publicado por Springer Berlin Heidelberg Sep 1990, 1990
ISBN 10: 3540531629 ISBN 13: 9783540531623
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 85,59
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Proving and rewriting.- Proving correctness w.r.t. specifications with hidden parts.- Hybrid implementations of algebraic specifications.- Multi-modal logic programming using equational and order-sorted logic.- Logic programs with equational type specifications.- Higher-order order-sorted algebras.- Axiomatization of a functional logic language.- Fourier algorithm revisited.- Fixpoint techniques for non-monotone maps.- Domain theory for nonmonotonic functions.- On the strong completion of logic programs.- An equivalence preserving first order unfold/fold transformation system.- Propositional calculus problems in CHIP.- Unfolding and fixpoint semantics of concurrent constraint logic programs.- Eliminating negation from normal logic programs.- On logic programming interpretations of Dislog: Programming long-distance dependencies in logic.- Recursive query processing in predicate-goal graph.- Implementation of completion by transition rules + control: ORME.- A matching process modulo a theory of categorical products.- Equation solving in conditional AC-theories.- Lazy narrowing in a graph machine.- An abstract concurrent machine for rewriting.- Applying term rewriting methods to finite groups.- Termination proofs by multiset path orderings imply primitive recursive derivation lengths.- Optimization of rewriting and complexity of rewriting.- AC-Termination of rewrite systems: A modified Knuth-Bendix ordering. 400 pp. Englisch.
Idioma: Inglés
Publicado por Springer, Springer Sep 1990, 1990
ISBN 10: 3540531629 ISBN 13: 9783540531623
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 53,49
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Proving and rewriting.- Proving correctness w.r.t. specifications with hidden parts.- Hybrid implementations of algebraic specifications.- Multi-modal logic programming using equational and order-sorted logic.- Logic programs with equational type specifications.- Higher-order order-sorted algebras.- Axiomatization of a functional logic language.- Fourier algorithm revisited.- Fixpoint techniques for non-monotone maps.- Domain theory for nonmonotonic functions.- On the strong completion of logic programs.- An equivalence preserving first order unfold/fold transformation system.- Propositional calculus problems in CHIP.- Unfolding and fixpoint semantics of concurrent constraint logic programs.- Eliminating negation from normal logic programs.- On logic programming interpretations of Dislog: Programming long-distance dependencies in logic.- Recursive query processing in predicate-goal graph.- Implementation of completion by transition rules + control: ORME.- A matching process modulo a theory of categorical products.- Equation solving in conditional AC-theories.- Lazy narrowing in a graph machine.- An abstract concurrent machine for rewriting.- Applying term rewriting methods to finite groups.- Termination proofs by multiset path orderings imply primitive recursive derivation lengths.- Optimization of rewriting and complexity of rewriting.- AC-Termination of rewrite systems: A modified Knuth-Bendix ordering.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 400 pp. Englisch.