Vendeur : GuthrieBooks, Spring Branch, TX, Etats-Unis
EUR 34,85
Quantité disponible : 1 disponible(s)
Ajouter au panierPaperback. Etat : Very Good. 0387531629 Ex-library paperback in very nice condition with the usual markings and attachments.
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
EUR 52,87
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New.
Vendeur : ALLBOOKS1, Direk, SA, Australie
EUR 59,33
Quantité disponible : 1 disponible(s)
Ajouter au panierBrand new book. Fast ship. Please provide full street address as we are not able to ship to P O box address.
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
EUR 57,76
Quantité disponible : Plus de 20 disponibles
Ajouter au panierEtat : New. In.
Vendeur : Chiron Media, Wallingford, Royaume-Uni
EUR 56,34
Quantité disponible : 10 disponible(s)
Ajouter au panierPF. Etat : New.
Edité par Springer Berlin Heidelberg, 1990
ISBN 10 : 3540531629 ISBN 13 : 9783540531623
Langue: anglais
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
EUR 53,49
Quantité disponible : 1 disponible(s)
Ajouter au panierTaschenbuch. Etat : 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.