From Interpreter to Compiler using Staging and Monads

From Interpreter to Compiler using Staging and Monads (1998)

Cached

Download Links

by Tim Sheard , Zine-el-abidine Benaissa

Citations:

2 - 0 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	From Interpreter to Compiler using Staging and Monads	SVM HeaderParse 0.1
AUTHOR NAME	Tim Sheard	SVM HeaderParse 0.1
AUTHOR AFFIL	Paci c Software Research Center; Oregon Graduate Institute	SVM HeaderParse 0.2
AUTHOR ADDR	P.O. Box 91000 Portland, Oregon 97291-1000 USA	SVM HeaderParse 0.1
AUTHOR NAME	Zine-el-abidine Benaissa	SVM HeaderParse 0.1
AUTHOR AFFIL	Paci c Software Research Center; Oregon Graduate Institute	SVM HeaderParse 0.2
AUTHOR ADDR	P.O. Box 91000 Portland, Oregon 97291-1000 USA	SVM HeaderParse 0.1
ABSTRACT	In writing this paper we had two goals. First, to promote MetaML, a programming language for writing staged programs, and second, to demonstrate that staging a program can have significant benefits. We do this by example: the derivation of an executable compiler for a small language. We derive the compiler in a rigorous fashion from a semantic description of the language. This is done by staging a denotational semantics, expressed as a monadic interpreter. The compiler is a program generator, taking a program in the source language "a while-program" as input and producing an ML program as target. The ML program produced is in a restricted subset of ML over which the programmer has complete control. It is encapsulated in a special data-structure called code. The meta-programming capabilities of MetaML allow this data-structure to be directly executed "run-time code generation", or to be analysed. We illustrate this analysis of generated code to build a source to source transf...	user correction - Legacy Corrections
YEAR	1998	INFERENCE
CITATIONS	34 found	ParsCit 1.0