My Account Log in

1 option

Compiling Natural Semantics / edited by Mikael Pettersson.

LIBRA Q341 .P7 2004
Loading location information...

Available from offsite location This item is stored in our repository but can be checked out.

Log in to request item
Format:
Book
Contributor:
Pettersson, Mikael, editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Lecture notes in computer science 0302-9743 ; 1549.
Lecture Notes in Computer Science, 0302-9743 ; 1549
Language:
English
Subjects (All):
Programming languages (Electronic computers).
Natural language processing (Computer science).
Computer logic.
Programming Languages, Compilers, Interpreters.
Natural Language Processing (NLP).
Logics and Meanings of Programs.
Local Subjects:
Programming Languages, Compilers, Interpreters.
Natural Language Processing (NLP).
Logics and Meanings of Programs.
Physical Description:
1 online resource (XVIII, 246 pages).
Edition:
First edition 1999.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1999.
System Details:
text file PDF
Summary:
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.
Contents:
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.
Other Format:
Printed edition:
ISBN:
978-3-540-48823-1
9783540488231
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

Find

Home Release notes

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Find catalog Using Articles+ Using your account