Algebraic and Logic Programming: Second International Conference, Nancy, France, October 1-3, 1990. Proceedings (Lecture Notes in Computer Science)

Kirchner, Helene [Editor]; Wechler, Wolfgang [Editor];

ISBN 10: 3540531629 / ISBN 13: 9783540531623

Editore: Springer, 1990

Riguardo questo articolo

We are unable to ship to Canada at this time.0387531629 Ex-library paperback in very nice condition with the usual markings and attachments.

Codice articolo DA1411637

Dati bibliografici

• Titolo: Algebraic and Logic Programming: Second International Conference, Nancy, France, October 1-3, 1990. Proceedings (Lecture Notes in Computer Science)
• Editore: Springer
• Data di pubblicazione: 1990
• Lingua: Inglese
• ISBN 10: 3540531629
• ISBN 13: 9783540531623
• Rilegatura: Paperback
• Condizione: Very Good
• Peso: 22 once

Descrizione articolo

Riassunto

This volume consists of papers presented at the Second International Conference on Algebraic and Logic Programming in Nancy, France, October 1-3, 1990.

Contenuti

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.