Hanus

Algebraic and Logic Programming

6th International Joint Conference, ALP '97 - HOA '97, Southhampton, UK, September 3-5, 1997. Proceedings
Mitarbeit:Hanus, Michael; Heering, Jan; Meinke, Karl

• Broschiertes Buch

Produktbeschreibung

This book constitutes the refereed proceedings of the 6th International Conference on Algebraic and Logic Programming, ALP '97 and the 3rd International Workshop on Higher-Order Algebra, Logic and Term Rewriting, HOA '97, held jointly in Southampton, UK, in September 1997.
The 18 revised full papers presented in the book were selected from 31 submissions. The volume is divided in sections on functional and logic programming, higher-order methods, term rewriting, types, lambda-calculus, and theorem proving methods.

---

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

Produktdetails

• Lecture Notes in Computer Science 1298
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 10546333, 978-3-540-63459-1
• 1997.
• Seitenzahl: 308
• Erscheinungstermin: 20. August 1997
• Englisch
• Abmessung: 235mm x 155mm x 17mm
• Gewicht: 406g
• ISBN-13: 9783540634591
• ISBN-10: 3540634592
• Artikelnr.: 09228431

Inhaltsangabe

Safe folding/unfolding with conditional narrowing.- Optimal non-deterministic functional logic computations.- A semantic basis for termination analysis of logic programs and its realization using symbolic norm constraints.- Parallelizing functional programs by generalization.- Higher-order equational unification via explicit substitutions.- Parameterised higher-order algebraic specifications.- Higher-order lazy narrowing calculus: A computation model for a higher-order functional logic language.- On composable properties of term rewriting systems.- Needed reductions with context-sensitive rewriting.- Conditional term graph rewriting.- Lazy narrowing with parametric order sorted types.- Termination of algebraic type systems: The syntactic approach.- Proof net semantics of proof search computation.- Explicit substitutions for the ??-calculus.- A left-linear variant of ??.- Perpetuality and uniform normalization.- Model generation with existentially quantified variables and constraints.- Optimal left-to-right pattern-matching automata.