000 | 02815nam a22005055i 4500 | ||
---|---|---|---|
001 | 978-3-540-48823-1 | ||
003 | DE-He213 | ||
005 | 20160624102037.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1999 gw | s |||| 0|eng d | ||
020 |
_a9783540488231 _9978-3-540-48823-1 |
||
024 | 7 |
_a10.1007/b71652 _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 |
100 | 1 |
_aPettersson, Mikael. _eauthor. |
|
245 | 1 | 0 |
_aCompiling Natural Semantics _h[electronic resource] / _cby Mikael Pettersson. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1999. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1999. |
|
300 |
_aXVIII, 246 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 ; _v1549 |
|
505 | 0 | _a1 Introduction -- 2 Preliminaries -- 3 The Design of RML -- 4 Examples -- 5 Implementation Overview -- 6 Reducing Nondeterminism -- 7 Compiling Pattern Matching -- 8 Compiling Continuations -- 9 Simulating Tailcalls in C -- 10 Performance Evaluation -- 11. Concluding Remarks -- A. The Definition of RML. | |
520 | _aNatural Semantics has become a popular tool among programming language researchers for specifying many aspects of programming languages. However, due to the lack of practical tools for implementation, the natural semantics formalism has so far largely been limited to theoretical applications. This book introduces the rational meta-language RML as a practical language for natural semantics specifications. The main part of the work is devoted to the problem of compiling natural semantics, actually RML, into highly efficient code. For this purpose, an effective compilation strategy for RML is developed and implemented in the rml2c compiler. This compiler ultimately produces low-level C code. Benchmarking results show that rml2c-produced code is much faster than code resulting from compilers based on alternative implementation approaches. | ||
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. |
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540659686 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v1549 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/b71652 |
942 |
_2EBK6591 _cEBK |
||
999 |
_c35885 _d35885 |