Algebraic and Logic Programming: Second International Conference Nancy, France, October 1–3, 1990 Proceedings

Proving and rewriting....Pages 1-24
Proving correctness w.r.t. specifications with hidden parts....Pages 25-39
Hybrid implementations of algebraic specifications....Pages 40-54
Multi-modal logic programming using equational and order-sorted logic....Pages 55-69
Logic programs with equational type specifications....Pages 70-85
Higher-order order-sorted algebras....Pages 86-100
Axiomatization of a functional logic language....Pages 101-116
Fourier algorithm revisited....Pages 117-131
Fixpoint techniques for non-monotone maps....Pages 132-143
Domain theory for nonmonotonic functions....Pages 144-157
On the strong completion of logic programs....Pages 158-172
An equivalence preserving first order unfold/fold transformation system....Pages 173-188
Propositional calculus problems in CHIP....Pages 189-203
Unfolding and fixpoint semantics of concurrent constraint logic programs....Pages 204-216
Eliminating negation from normal logic programs....Pages 217-231
On logic programming interpretations of Dislog: Programming long-distance dependencies in logic....Pages 232-246
Recursive query processing in predicate-goal graph....Pages 247-261
Implementation of completion by transition rules + control: ORME ....Pages 262-269
A matching process modulo a theory of categorical products....Pages 270-282
Equation solving in conditional AC-theories....Pages 283-297
Lazy narrowing in a graph machine....Pages 298-317
An abstract concurrent machine for rewriting....Pages 318-331
Applying term rewriting methods to finite groups....Pages 332-346
Termination proofs by multiset path orderings imply primitive recursive derivation lengths....Pages 347-358
Optimization of rewriting and complexity of rewriting....Pages 359-371
AC-Termination of rewrite systems: A modified Knuth-Bendix ordering....Pages 372-386