Algebraic and Logic Programming 6th International Joint Conference, ALP '97 - HOA '97, Southhampton, UK, September 3-5, 1997. Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Hanus, Michael (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Heering, Jan (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Meinke, Karl (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1997.
• Έκδοση: 1st ed. 1997.
• Σειρά: Lecture Notes in Computer Science, 1298
• Θέματα: Programming languages (Electronic computers).; Computers.; Architecture, Computer.; Computer logic.; Mathematical logic.; Artificial intelligence.; Programming Languages, Compilers, Interpreters.; Theory of Computation.; Computer System Implementation.; Logics and Meanings of Programs.; Mathematical Logic and Formal Languages.; Artificial Intelligence.

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

Πίνακας περιεχομένων:

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