| 000 | 02804nam a22005415i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-39786-1 | ||
| 003 | DE-He213 | ||
| 005 | 20160624101945.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s1986 gw | s |||| 0|eng d | ||
| 020 |
_a9783540397861 _9978-3-540-39786-1 |
||
| 024 | 7 |
_a10.1007/3-540-16446-4 _2doi |
|
| 050 | 4 | _aQA76.9.L63 | |
| 050 | 4 | _aQA76.5913 | |
| 050 | 4 | _aQA76.63 | |
| 072 | 7 |
_aUM _2bicssc |
|
| 072 | 7 |
_aUYF _2bicssc |
|
| 072 | 7 |
_aCOM051000 _2bisacsh |
|
| 072 | 7 |
_aCOM036000 _2bisacsh |
|
| 082 | 0 | 4 |
_a005.1015113 _223 |
| 245 | 1 | 0 |
_aPrograms as Data Objects _h[electronic resource] : _bProceedings of a Workshop Copenhagen, Denmark, October 17–19, 1985 / _cedited by Harald Ganzinger, Neil D. Jones. |
| 260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1986. |
|
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1986. |
|
| 300 |
_aX, 325 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 ; _v217 |
|
| 505 | 0 | _aStrictness analysis and polymorphic invariance -- Convergent term rewriting systems can be used for program transformation -- The theory of strictness analysis for higher order functions -- Recognition of generative languages -- Modular first-order specifications of operational semantics -- Logic specification of code generation techniques -- Strictness detection in non-flat domains -- Strictness computation using special ?-expressions -- A relational framework for abstract interpretation -- Expected forms of data flow analyses -- Code generation from two-level denotational meta-languages -- Multilevel functions in Martin-Löf's type theory -- An implementation from a direct semantics definition -- The structure of a self-applicable partial evaluator -- Program transformation by supercompilation -- Listlessness is better than laziness II: Composing listless functions -- From interpreter to compiler: A representational derivation. | |
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aSoftware engineering. | |
| 650 | 0 | _aLogic design. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aLogics and Meanings of Programs. |
| 650 | 2 | 4 | _aProgramming Techniques. |
| 650 | 2 | 4 | _aSoftware Engineering. |
| 700 | 1 |
_aGanzinger, Harald. _eeditor. |
|
| 700 | 1 |
_aJones, Neil D. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540164463 |
| 786 | _dSpringer | ||
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v217 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-16446-4 |
| 942 |
_2EBK4716 _cEBK |
||
| 999 |
_c34010 _d34010 |
||