Skip to main content
SpringerLink
Log in
Book cover

Algebraic and Logic Programming

Third International Conference, Volterra, Italy, September 2-4, 1992. Proceedings

  • Conference proceedings
  • © 1992

Overview

Editors:
  1. Hélène Kirchner
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Giorgio Levi
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 632)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (29 papers)

  1. Front Matter

    Download chapter PDF

  2. Outline of an object-oriented calculus of higher type

    • Hassan Aït-Kaci
    Pages 1-2

  3. High-level-replacement systems for equational algebraic specifications

    • H. Ehrig, F. Parisi-Presicce
    Pages 3-20

  4. Termination of rewrite systems by elementary interpretations

    • Pierre Lescanne
    Pages 21-36

  5. Termination of order-sorted rewriting

    • Isabelle Gnaedig
    Pages 37-52

  6. Generalized sufficient conditions for modular termination of rewriting

    • Bernhard Gramlich
    Pages 53-68

  7. A theory of first-order built-in's of prolog

    • Krzysztof R. Apt, Elena Marchiori, Catuscia Palamidessi
    Pages 69-83

  8. Fixpoint semantics for partial computed answer substitutions and call patterns

    • Maurizio Gabbrielli, Maria Chiara Meo
    Pages 84-99

  9. Oracle semantics for Prologa

    • Roberto Barbuti, Michael Codish, Roberto Giacobazzi, Michael Maher
    Pages 100-114

  10. On the relation between primitive recursion, schematization, and divergence

    • Miki Hermann
    Pages 115-127

  11. Term rewriting with sharing and memoïzation

    • Berthold Hoffmann
    Pages 128-142

  12. Definitional trees

    • Sergio Antoy
    Pages 143-157

  13. Multiparadigm logic programming

    • José Meseguer
    Pages 158-200

  14. Non-linear real constraints in constraint logic programming

    • Hoon Hong
    Pages 201-212

  15. A general scheme for constraint functional logic programming

    • Francisco Javier, López Fraguas
    Pages 213-227

  16. Incremental rewriting in narrowing derivations

    • Michael Hanus
    Pages 228-243

  17. Counterexamples to completeness results for basic narrowing (extended abstract)

    • Aart Middeldorp, Erik Hamoen
    Pages 244-258

  18. Uniform narrowing strategies

    • Rachid Echahed
    Pages 259-275

  19. Proof by consistency in constructive systems with final algebra semantics

    • Olav Lysne
    Pages 276-290

  20. A fast algorithm for ground normal form analysis

    • Reinhard Bündgen, Hasko Eckhardt
    Pages 291-305
Back to top

Keywords

About this book

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation