| 000 | 03202nam a22005055i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-48164-5 | ||
| 003 | DE-He213 | ||
| 005 | 20160624102030.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s1999 gw | s |||| 0|eng d | ||
| 020 |
_a9783540481645 _9978-3-540-48164-5 |
||
| 024 | 7 |
_a10.1007/10704567 _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 |
_aPrinciples and Practice of Declarative Programming _h[electronic resource] : _bInternational Conference, PPDP’99, Paris, France, September, 29 - October 1, 1999. Proceedings / _cedited by Gopalan Nadathur. |
| 260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1999. |
|
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1999. |
|
| 300 |
_aX, 442 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 ; _v1702 |
|
| 505 | 0 | _aC-—: A Portable Assembly Language that Supports Garbage Collection -- On Formalised Proofs of Termination of Recursive Functions -- Argument Filtering Transformation -- A Primitive Calculus for Module Systems -- Non-dependent Types for Standard ML Modules -- Constraint Programming in OPL -- Compiling Constraint Handling Rules into Prolog with Attributed Variables -- Parallel Execution Models for Constraint Programming over Finite Domains -- Functional Plus Logic Programming with Built-In and Symbolic Constraints -- A Calculus for Interaction Nets -- Distributed Programming in a Multi-Paradigm Declarative Language -- Logical and Meta-Logical Frameworks -- A Simple and General Method for Integrating Abstract Interpretation in SICStus -- Run Time Type Information in Mercury -- A Virtual Machine for a Process Calculus -- Optimising Bytecode Emulation for Prolog -- OPENLOG: A Logic Programming Language Based on Abduction -- An Operational Semantics of Starlog -- On the Verification of Finite Failure -- Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-Slices -- Modular Termination Proofs for Prolog with Tabling -- Declarative Program Transformation: A Deforestation Case-Study -- A Semantic Account of Type-Directed Partial Evaluation -- A Parameterized Unfold/Fold Transformation Framework for Definite Logic Programs -- Widening Sharing. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aLogic design. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aProgramming Languages, Compilers, Interpreters. |
| 650 | 2 | 4 | _aLogics and Meanings of Programs. |
| 650 | 2 | 4 | _aProgramming Techniques. |
| 700 | 1 |
_aNadathur, Gopalan. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540665403 |
| 786 | _dSpringer | ||
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v1702 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/10704567 |
| 942 |
_2EBK6340 _cEBK |
||
| 999 |
_c35634 _d35634 |
||