Language: English
Published by Springer-Verlag, New York, 1990
ISBN 10: 0387531629 ISBN 13: 9780387531625
Seller: Munster & Company LLC, ABAA/ILAB, Corvallis, OR, U.S.A.
Paperback. Condition: Very Good. New York: Springer-Verlag, 1990. vii, 386 pp. 24 x 16.5 cm. Stiff paper wrappers printed in silver and maroon with white and maroon lettering to covers and spine. Some light rubbing to spine ends and corners of covers. Two light smudges to fore-edge of text block. Interior is clean and unmarked. Binding sound with no creases or cracks. . Soft Cover. Very Good.
Condition: New.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
£ 49.30
Quantity: Over 20 available
Add to basketCondition: New. In.
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New.
Language: English
Published by Springer Berlin Heidelberg, 1990
ISBN 10: 3540531629 ISBN 13: 9783540531623
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: 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.
Taschenbuch. Condition: Neu. Algebraic and Logic Programming | Second International Conference, Nancy, France, October 1-3, 1990. Proceedings | Helene Kirchner (u. a.) | Taschenbuch | ix | Englisch | 1990 | Springer | EAN 9783540531623 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.