Monad Transformers and Modular Interpreters

Monad Transformers and Modular Interpreters (1995)

Cached

Download Links

[www.cis.upenn.edu]
[eecs.harvard.edu]
[www.cs.yale.edu]

Other Repositories/Bibliography

DBLP

by Sheng Liang , Paul Hudak , Mark Jones

Venue:	In Proceedings of the 22nd ACM Symposium on Principles of Programming Languages. ACMPress
Citations:	213 - 10 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Monad Transformers and Modular Interpreters	user correction - Legacy Corrections
AUTHOR NAME	Sheng Liang	user correction - Legacy Corrections
AUTHOR AFFIL	Yale University; Department of Computer Science	user correction - Legacy Corrections
AUTHOR ADDR	New Haven, CT 06520-8285	user correction - Legacy Corrections
AUTHOR NAME	Paul Hudak	user correction - Legacy Corrections
AUTHOR AFFIL	Yale University; Department of Computer Science	user correction - Legacy Corrections
AUTHOR ADDR	New Haven, CT 06520-8285	user correction - Legacy Corrections
AUTHOR NAME	Mark Jones	user correction - Legacy Corrections
AUTHOR AFFIL	Yale University; Department of Computer Science	user correction - Legacy Corrections
AUTHOR ADDR	New Haven, CT 06520-8285	user correction - Legacy Corrections
ABSTRACT	We show how a set of building blocks can be used to construct programming language interpreters, and present implementations of such building blocks capable of supporting many commonly known features, including simple expressions, three different function call mechanisms (call-by-name, callby -value and lazy evaluation), references and assignment, nondeterminism, first-class continuations, and program tracing. The underlying mechanism of our system is monad transformers, a simple form of abstraction for introducing a wide range of computational behaviors, such as state, I/O, continuations, and exceptions. Our work is significant in the following respects. First, we have succeeded in designing a fully modular interpreter based on monad transformers that includes features missing from Steele's, Espinosa's, and Wadler's earlier efforts. Second, we have found new ways to lift monad operations through monad transformers, in particular difficult cases not achieved in Moggi's original work. ...	user correction - Legacy Corrections
YEAR	1995	INFERENCE
VENUE	In Proceedings of the 22nd ACM Symposium on Principles of Programming Languages. ACMPress	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
CITATIONS	21 found	ParsCit 1.0