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

Front Cover
Springer Science & Business Media, Aug 19, 1992 - Computers - 457 pages
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.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Selected pages

Contents

Outline of an objectoriented calculus of higher t ype invited talk
1
Highlevelreplacement systems for equational algebraic specifications
3
Termination of rewrite systems by elementary interpretations
21
Termination of ordersorted rewriting
37
Generalized sufficient conditions for modular termination of rewriting
53
A theory of firstorder builtins of Prolog
69
Fixpoint semantics for partial computed answer substitutions and call patterns
84
Oracle semantics for Prolog
100
Counterexamples to completeness results for basic narrowing Extended Abstract
244
Uniform narrowing strategies
259
Proof by consistency in constructive systems with final algebra semantics
276
A fast algorithm for ground normal form analysis
291
Etaconversion for the languages of explicit substitutions
306
Serialisation analysis of concurrent logic programs
322
Implementation of a toolset for prototyping algebraic specifications of concurrent systems
335
Axiomatizing permutation equivalence in the 𝜆calculus
350

On the relation between primitive recursion schematization and divergence
115
Term rewriting with sharing and memoïzation
128
Definitional trees
143
Multiparadigm logic programming invited talk
158
Nonlinear real constraints in constraint logic programming
201
A general scheme for constraint functional logic programming
213
Incremental rewriting in narrowing derivations
228
A CLP View of Logic Programming invited talk
364
Partial deduction of logic programs wrt wellfounded semantics
384
The finiteness of logic programming derivations
403
Theorem proving for hierarchic firstorder theories
420
A goal oriented strategy based on completion
435
On nsyntactic equational theories
446
Copyright

Other editions - View all

Common terms and phrases

Bibliographic information