000 | 03626nam a22005655i 4500 | ||
---|---|---|---|
001 | 978-3-540-69555-4 | ||
003 | DE-He213 | ||
005 | 20160624102057.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1997 gw | s |||| 0|eng d | ||
020 |
_a9783540695554 _9978-3-540-69555-4 |
||
024 | 7 |
_a10.1007/BFb0026998 _2doi |
|
050 | 4 | _aQA76.7-76.73 | |
050 | 4 | _aQA76.76.C65 | |
072 | 7 |
_aUMX _2bicssc |
|
072 | 7 |
_aUMC _2bicssc |
|
072 | 7 |
_aCOM051010 _2bisacsh |
|
072 | 7 |
_aCOM010000 _2bisacsh |
|
082 | 0 | 4 |
_a005.13 _223 |
245 | 1 | 0 |
_aAlgebraic and Logic Programming _h[electronic resource] : _b6th International Joint Conference ALP '97 — HOA '97 Southampton, UK, September 3–5, 1997 Proceedings / _cedited by Michael Hanus, Jan Heering, Karl Meinke. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1997. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1997. |
|
300 |
_aXI, 297 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v1298 |
|
505 | 0 | _aSafe 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. | |
520 | _aThis 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. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aLogic design. | |
650 | 0 | _aArtificial intelligence. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aProgramming Languages, Compilers, Interpreters. |
650 | 2 | 4 | _aLogics and Meanings of Programs. |
650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
650 | 2 | 4 | _aArtificial Intelligence (incl. Robotics). |
700 | 1 |
_aHanus, Michael. _eeditor. |
|
700 | 1 |
_aHeering, Jan. _eeditor. |
|
700 | 1 |
_aMeinke, Karl. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540634591 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v1298 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/BFb0026998 |
942 |
_2EBK7255 _cEBK |
||
999 |
_c36549 _d36549 |