Vai al contenuto principale della pagina
Autore: |
Pettersson Mikael
![]() |
Titolo: |
Compiling natural semantics / / Mikael Pettersson
![]() |
Pubblicazione: | Berlin ; ; Heidelberg : , : Springer, , [1999] |
©1999 | |
Edizione: | 1st ed. 1999. |
Descrizione fisica: | 1 online resource (XVIII, 246 p.) |
Disciplina: | 005.131 |
Soggetto topico: | Programming languages (Electronic computers) - Semantics |
Note generali: | Bibliographic Level Mode of Issuance: Monograph |
Nota di bibliografia: | Includes bibliographical references and index. |
Nota di contenuto: | 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. |
Sommario/riassunto: | 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. |
Titolo autorizzato: | Compiling natural semantics ![]() |
ISBN: | 3-540-48823-5 |
Formato: | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 9910143478503321 |
Lo trovi qui: | Univ. Federico II |
Opac: | Controlla la disponibilità qui |