Hanus

Algebraic and Logic Programming

5th International Conference, ALP '96, Aachen, Germany, September 25 - 27, 1996. Proceedings
Mitarbeit:Hanus, Michael; Rodriguez-Artalejo, Mario

• Broschiertes Buch

Produktbeschreibung

This book constitutes the refereed proceedings of the Fifth International Conference on Algebraic and Logic Programming, ALP '96, held in Aachen, Germany, in September 1996 in conjunction with PLILP and SAS.
The volume presents 21 revised full papers selected from 54 submissions; also included is an invited contribution by Claude Kirchner and Ilies Alouini entitled "Toward the Concurrent Implementation of Computational Systems". The volume is divided into topical sections on logic programming, term rewriting, integration of paradigms, abstract interpretation, Lambda-calculus and rewriting, and types.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Lecture Notes in Computer Science 1139
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-61735-8
• 1996.
• Seitenzahl: 360
• Erscheinungstermin: 11. September 1996
• Englisch
• Abmessung: 235mm x 155mm x 20mm
• Gewicht: 468g
• ISBN-13: 9783540617358
• ISBN-10: 3540617353
• Artikelnr.: 09228556

Inhaltsangabe

Toward the concurrent implementation of computational systems.- On negation as instantiation.- Independence in dynamically scheduled logic languages.- Heterogeneous constraint solving.- A hierarchy of semantics for normal constraint logic programs.- Order-sorted termination: The unsorted way.- Unravelings and ultra-properties.- Standardization theorem revisited.- Discrete Normalization and Standardization in Deterministic Residual Structures.- A language for the logical specification of processes and relations.- A process algebra for synchronous concurrent constraint programming.- An algebraic approach to mixins and modularity.- A strict border for the decidability of E-unification for recursive functions.- Prime factorizations of abstract domains using first-order logic.- Abstractions of uniform proofs.- Complementing logic program semantics.- Meaningless terms in rewriting.- Unique normal form property of Higher-Order Rewriting Systems.- ?-calculi with explicit substitutions and composition which preserve ?-strong normalization.- Algebraic semantics for functional logic programming with polymorphic order-sorted types.- Specifying type systems.- The semantic treatment of polymorphic specification languages.