Catuscia Palamidessi (auth.), Giorgio Levi, Mario Rodríguez-Artalejo (eds.)3540584315, 9783540584315
Like the predecessor conferences in this series, ALP ’94 succeeded in strengthening the cross-fertilization between algebraic techniques and logic programming. Besides abstracts of three invited talks, the volume contains 17 full revised papers selected from 41 submissions; the papers are organized into sections on theorem proving, narrowing, logic programming, term rewriting, and higher-order programming.
Table of contents :
Concurrent constraint programming….Pages 1-2
Specifications using multiple-conclusion logic programs….Pages 3-4
Viewing a program transformation system at work….Pages 5-5
Proving implications by algebraic approximation….Pages 6-22
Sufficient completeness and parameterized proofs by induction….Pages 23-40
Proving behavioural theorems with standard first-order logic….Pages 41-58
How to realize LSE narrowing….Pages 59-76
Compositional analysis for equational Horn programs….Pages 77-94
Equation solving in projective planes and planar ternary rings….Pages 95-113
From eventual to atomic and locally atomic CC programs: A concurrent semantics….Pages 114-132
Concurrent logic programming as uniform linear proofs….Pages 133-149
Three-valued completion for abductive logic programs….Pages 150-167
A sequential reduction strategy….Pages 168-185
On modularity of termination and confluence properties of conditional rewrite systems….Pages 186-203
Syntactical analysis of total termination….Pages 204-222
Logic programs as term rewriting systems….Pages 223-241
Higher-order minimal function graphs….Pages 242-252
Reasoning about layered, wildcard and product patterns….Pages 253-268
Preserving universal termination through unfold/fold….Pages 269-286
A logic for variable aliasing in logic programs….Pages 287-304
Reviews
There are no reviews yet.