Algebraic and Logic Programming: Third International Conference Volterra, Italy, September 2–4, 1992 Proceedings

Hassan Aït-Kaci (auth.), Hélène Kirchner, Giorgio Levi (eds.)354055873X, 9783540558736, 038755873X

This volume contains the proceedings of the Third International Conference on Algebraic and Logic Programming, held in Pisa, Italy, September 2-4, 1992. Like the two previous conferences in Germany in 1988 and France in 1990, the third conference aims at strengthening the connections betweenalgebraic techniques and logic programming. On the one hand, logic programming has been very successful during the last decades and more and more systems compete in enhancing its expressive power. On the other hand, concepts like functions, equality theory, and modularity are particularly well handled in an algebraic framework. Common foundations of both approaches have recently been developed, and this conference is a forum for people from both areas to exchange ideas, results, and experiences. The book covers the following topics: semantics ofalgebraic and logic programming; integration of functional and logic programming; term rewriting, narrowing, and resolution; constraintlogic programming and theorem proving; concurrent features in algebraic and logic programming languages; and implementation issues.

---

Table of contents :
Outline of an object-oriented calculus of higher type….Pages 1-2
High-level-replacement systems for equational algebraic specifications….Pages 3-20
Termination of rewrite systems by elementary interpretations….Pages 21-36
Termination of order-sorted rewriting….Pages 37-52
Generalized sufficient conditions for modular termination of rewriting….Pages 53-68
A theory of first-order built-in’s of prolog….Pages 69-83
Fixpoint semantics for partial computed answer substitutions and call patterns….Pages 84-99
Oracle semantics for Prologa….Pages 100-114
On the relation between primitive recursion, schematization, and divergence….Pages 115-127
Term rewriting with sharing and memoïzation….Pages 128-142
Definitional trees….Pages 143-157
Multiparadigm logic programming….Pages 158-200
Non-linear real constraints in constraint logic programming….Pages 201-212
A general scheme for constraint functional logic programming….Pages 213-227
Incremental rewriting in narrowing derivations….Pages 228-243
Counterexamples to completeness results for basic narrowing (extended abstract)….Pages 244-258
Uniform narrowing strategies….Pages 259-275
Proof by consistency in constructive systems with final algebra semantics….Pages 276-290
A fast algorithm for ground normal form analysis….Pages 291-305
Eta-conversion for the languages of explicit substitutions….Pages 306-321
Serialisation analysis of concurrent logic programs….Pages 322-334
Implementation of a toolset for prototyping algebraic specifications of concurrent systems….Pages 335-349
Axiomatizing permutation equivalence in the λ-calculus….Pages 350-363
A CLP view of logic programming….Pages 364-383
Partial deduction of logic programs WRT well-founded semantics….Pages 384-402
The finiteness of logic programming derivations….Pages 403-419
Theorem proving for hierarchic first-order theories….Pages 420-434
A goal oriented strategy based on completion….Pages 435-445
On n -syntactic equational theories….Pages 446-457