000 | 03253nam a22006375i 4500 | ||
---|---|---|---|
001 | 978-3-540-44978-2 | ||
003 | DE-He213 | ||
005 | 20240423132435.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2001 gw | s |||| 0|eng d | ||
020 |
_a9783540449782 _9978-3-540-44978-2 |
||
024 | 7 |
_a10.1007/3-540-44978-7 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYA _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aPrograms as Data Objects _h[electronic resource] : _bSecond Symposium, PADO 2001, Aarhus, Denmark, May 21-23, 2001, Proceedings / _cedited by Olivier Danvy, Andrzej Filinski. |
250 | _a1st ed. 2001. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2001. |
|
300 |
_aX, 286 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, _x1611-3349 ; _v2053 |
|
505 | 0 | _aInvited Opening Talk -- Program Analysis for Implicit Computational Complexity -- Contributed Papers -- Deriving Pre-conditions for Array Bound Check Elimination -- Type Systems for Useless-Variable Elimination -- Boolean Constraints for Binding-Time Analysis -- Constraint Abstractions -- Implementing Circularity Using Partial Evaluation -- Combining Forward And Backward Analyses of Temporal Properties -- Numerical Power Analysis -- Run-Time Bytecode Specialization -- A New Numerical Abstract Domain Based on Difference-Bound Matrices -- Partial Evaluation for Class-Based Object-Oriented Languages -- Driving in the Jungle -- Higher-Order Pattern Matching for Automatically Applying Fusion Transformations -- Dynamic Partial Evaluation -- Tag Elimination and Jones-Optimality -- Invited Closing Talk -- Bottom-Up Deduction with Deletion and Priorities. | |
650 | 0 | _aComputer science. | |
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aInformation theory. | |
650 | 0 | _aApplication software. | |
650 | 0 | _aCompilers (Computer programs). | |
650 | 0 | _aMachine theory. | |
650 | 0 | _aSoftware engineering. | |
650 | 1 | 4 | _aComputer Science Logic and Foundations of Programming. |
650 | 2 | 4 | _aData Structures and Information Theory. |
650 | 2 | 4 | _aComputer and Information Systems Applications. |
650 | 2 | 4 | _aCompilers and Interpreters. |
650 | 2 | 4 | _aFormal Languages and Automata Theory. |
650 | 2 | 4 | _aSoftware Engineering. |
700 | 1 |
_aDanvy, Olivier. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aFilinski, Andrzej. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783540420682 |
776 | 0 | 8 |
_iPrinted edition: _z9783662164662 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v2053 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-44978-7 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
912 | _aZDB-2-BAE | ||
942 | _cSPRINGER | ||
999 |
_c187779 _d187779 |