Algebraic and Logic Programming Third International Conference, Volterra, Italy, September 2-4, 1992. Proceedings / edited by Helene Kirchner, Giorgio Levi.

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 betweenalgebrai...

Full description

Saved in:
Bibliographic Details
Corporate Author: SpringerLink (Online service)
Other Authors: Kirchner, Helene (Editor), Levi, Giorgio (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1992.
Edition:1st ed. 1992.
Series:Lecture Notes in Computer Science, 632
Springer eBook Collection.
Subjects:
Online Access:Click to view e-book
Holy Cross Note:Loaded electronically.
Electronic access restricted to members of the Holy Cross Community.
Table of Contents:
  • Outline of an object-oriented calculus of higher type
  • High-level-replacement systems for equational algebraic specifications
  • Termination of rewrite systems by elementary interpretations
  • Termination of order-sorted rewriting
  • Generalized sufficient conditions for modular termination of rewriting
  • A theory of first-order built-in's of prolog
  • Fixpoint semantics for partial computed answer substitutions and call patterns
  • Oracle semantics for Prologa
  • On the relation between primitive recursion, schematization, and divergence
  • Term rewriting with sharing and memoïzation
  • Definitional trees
  • Multiparadigm logic programming
  • Non-linear real constraints in constraint logic programming
  • A general scheme for constraint functional logic programming
  • Incremental rewriting in narrowing derivations
  • Counterexamples to completeness results for basic narrowing (extended abstract)
  • Uniform narrowing strategies
  • Proof by consistency in constructive systems with final algebra semantics
  • A fast algorithm for ground normal form analysis
  • Eta-conversion for the languages of explicit substitutions
  • Serialisation analysis of concurrent logic programs
  • Implementation of a toolset for prototyping algebraic specifications of concurrent systems
  • Axiomatizing permutation equivalence in the ?-calculus
  • A CLP view of logic programming
  • Partial deduction of logic programs WRT well-founded semantics
  • The finiteness of logic programming derivations
  • Theorem proving for hierarchic first-order theories
  • A goal oriented strategy based on completion
  • On n-syntactic equational theories.