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

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

Full description

Bibliographic Details
Other Authors: Hanus, Michael (Editor), Heering, Jan (Editor), Meinke, Karl (Editor)
Format: eBook
Language:English
Published: Berlin, Heidelberg Springer Berlin Heidelberg 1997, 1997
Edition:1st ed. 1997
Series:Lecture Notes in Computer Science
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
LEADER 03090nmm a2200409 u 4500
001 EB000659593
003 EBX01000000000000000512675
005 00000000000000.0
007 cr|||||||||||||||||||||
008 140122 ||| eng
020 |a 9783540695554 
100 1 |a Hanus, Michael  |e [editor] 
245 0 0 |a Algebraic and Logic Programming  |h Elektronische Ressource  |b 6th International Joint Conference, ALP '97 - HOA '97, Southhampton, UK, September 3-5, 1997. Proceedings  |c edited by Michael Hanus, Jan Heering, Karl Meinke 
250 |a 1st ed. 1997 
260 |a Berlin, Heidelberg  |b Springer Berlin Heidelberg  |c 1997, 1997 
300 |a XI, 297 p  |b online resource 
505 0 |a 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 
653 |a Computer systems 
653 |a Compilers (Computer programs) 
653 |a Computer Science Logic and Foundations of Programming 
653 |a Compilers and Interpreters 
653 |a Computer science 
653 |a Computer System Implementation 
653 |a Artificial Intelligence 
653 |a Formal Languages and Automata Theory 
653 |a Machine theory 
653 |a Artificial intelligence 
653 |a Theory of Computation 
700 1 |a Heering, Jan  |e [editor] 
700 1 |a Meinke, Karl  |e [editor] 
041 0 7 |a eng  |2 ISO 639-2 
989 |b SBA  |a Springer Book Archives -2004 
490 0 |a Lecture Notes in Computer Science 
028 5 0 |a 10.1007/BFb0026998 
856 4 0 |u https://doi.org/10.1007/BFb0026998?nosfx=y  |x Verlag  |3 Volltext 
082 0 |a 005.45 
520 |a 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