TY  - BOOK
AU  - Pettersson,Mikael
TI  - Compiling natural semantics
T2  - Lecture notes in computer science
SN  - 9783540488231
AV  - QA76.7 .P493 1999
U1  - 005.13/1 21
PY  - 1999///
CY  - Berlin, New York
PB  - Springer
KW  - Programming languages (Electronic computers)
KW  - Semantics
KW  - Langages de programmation
KW  - Sémantique
KW  - fast
KW  - Semantiek
KW  - gtt
KW  - Compiladores, processadores, interpretadores (computadores)
KW  - larpcal
KW  - Semantique
KW  - ram
KW  - Compilation (informatique)
KW  - Congressen (vorm)
N1  - Includes bibliographical references and index; 1 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
N2  - Natural 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
UR  - https://link.springer.com/10.1007/b71652
ER  -