Blick ins Buch

Algebraic and Logic Programming

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

Helene Kirchner, Giorgio Levi (Herausgeber)

Buch | Softcover

IX, 460 Seiten

1992 | 1992
Springer Berlin (Verlag)
978-3-540-55873-6 (ISBN)

Lese- und Medienproben

Inhaltsverzeichnis (PDF)

Artikel merken

This volume contains the proceedings of the ThirdInternational Conference on Algebraic and Logic Programming,held in Pisa, Italy, September 2-4, 1992. Like the twoprevious conferences in Germany in 1988 and France in 1990,the third conference aims at strengthening the connectionsbetweenalgebraic techniques and logic programming. On theone hand, logic programming has been very successful duringthe last decades and more and more systems compete inenhancing its expressive power. On the other hand, conceptslike functions, equality theory, and modularity areparticularly well handled in an algebraic framework. Commonfoundations of both approaches have recently been developed,and this conference is a forum for people from both areas toexchange ideas, results, and experiences. The book coversthe following topics: semantics ofalgebraic and logicprogramming; integration of functional and logicprogramming; term rewriting, narrowing, and resolution;constraintlogic programming and theorem proving; concurrentfeatures in algebraic and logic programming languages; andimplementation issues.

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.

Erscheint lt. Verlag	19.8.1992
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	IX, 460 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 235 mm
Gewicht	698 g
Themenwelt	Mathematik / Informatik ► Informatik ► Programmiersprachen / -werkzeuge
	Mathematik / Informatik ► Informatik ► Software Entwicklung
	Informatik ► Theorie / Studium ► Compilerbau
Schlagworte	Abstract Data Types • Abstrakte Datentypen • Algebraisches Programmieren • Algebric Programming • Concurrency • formale Sprachen • Hardcover, Softcover / Informatik, EDV/Programmiersprachen • HC/Informatik, EDV/Programmiersprachen • Logic • Logic Programming • Logisches Programmieren • Mathematische Logik • Nebenläufigkeit • programming • Programming language • Resolution • Rewriting Systems • Semantics • Termersetzungssysteme • theorem proving
ISBN-10	3-540-55873-X / 354055873X
ISBN-13	978-3-540-55873-6 / 9783540558736
Zustand	Neuware