Modular Compilers Based on Monad Transformers

Modular Compilers Based on Monad Transformers (1998)

Cached

Download Links

[www-sal.cs.uiuc.edu]
[www-sal.cs.uiuc.edu]

Other Repositories/Bibliography

DBLP

by William Harrison , Samuel N. Kamin

Venue:	In Proceedings of the IEEE International Conference on Computer Languages
Citations:	19 - 2 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Modular Compilers Based on Monad Transformers	user correction - Legacy Corrections
AUTHOR NAME	William Harrison	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Computer Science; University of Illinois, Urbana-Champaign	user correction - Legacy Corrections
AUTHOR ADDR	Urbana, Illinois 61801-2987	user correction - Legacy Corrections
AUTHOR NAME	Samuel N. Kamin	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Computer Science; University of Illinois, Urbana-Champaign	user correction - Legacy Corrections
AUTHOR ADDR	Urbana, Illinois 61801-2987	user correction - Legacy Corrections
ABSTRACT	The monadic style of language specification has the advantages of modularity and extensibility: it is simple to add or change features in an interpreter to reflect modifications in the source language. It has proven difficult to extend the method to compilation. We demonstrate that by introducing machine-like stores (code and data) into the monadic semantics and then partially evaluating the resulting semantic expressions, we can achieve many of the same advantages for a compiler as for an interpreter. A number of language constructs and features are compiled: expressions, CBV and CBN evaluation of -expressions, dynamic scoping, and various imperative features. The treatment of recursive procedures is outlined as well. The resulting method allows compilers to be constructed in a mix-and-match fashion just as in a monad-structured interpreter. 1 Introduction and Related Work This paper concerns the construction of modular compilers for high-level programming languages from reusable co...	user correction - Legacy Corrections
YEAR	1998	INFERENCE
VENUE	In Proceedings of the IEEE International Conference on Computer Languages	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	122--131	INFERENCE
CITATIONS	20 found	ParsCit 1.0