DMCA
Representing Layered Monads (1999)
| Venue: | PROCEEDINGS OF THE TWENTY-SIXTH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES |
| Citations: | 63 - 2 self |
BibTeX
@INPROCEEDINGS{Filinski99representinglayered,
author = {Andrzej Filinski},
title = {Representing Layered Monads},
booktitle = {PROCEEDINGS OF THE TWENTY-SIXTH ANNUAL ACM SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES},
year = {1999},
pages = {175--188},
publisher = {ACM Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
There has already been considerable research on constructing modular, monad-based specications of computational effects (state, exceptions, nondeterminism, etc.) in programming languages. We present a simple framework in this tradition, based on a Church-style effect-typing system for an ML-like language. The semantics of this language is formally dened by a series of monadic translations, each one expanding away a layer of effects. Such a layered specication is easy to reason about, but its direct implementation (whether by parameterized interpretation or by actual translation) is often prohibitively inefficient. By exploiting deeper semantic properties of monads, however, it is also possible to derive a vastly more efficient implementation: we show that each layer of eects can be uniformly simulated by continuation-passing, and further that multiple such layers can themselves be simulated by a standard semantics for call/cc and mutable state. Thus, even multi-effect programs can be execu...
Keyphrases
layered monad efficient implementation layered specication standard semantics prohibitively inefficient ml-like language mutable state actual translation direct implementation call cc considerable research monadic translation simple framework monad-based specications church-style effect-typing system parameterized interpretation multi-effect program multiple layer semantic property computational effect
