DMCA
Representing Monads (1994)
| Venue: | Proceedings of the Twenty-First Annual ACM Symposium on Principles of Programming Languages |
| Citations: | 149 - 3 self |
BibTeX
@INPROCEEDINGS{Filinski94representingmonads,
author = {Andrzej Filinski},
title = {Representing Monads},
booktitle = {Proceedings of the Twenty-First Annual ACM Symposium on Principles of Programming Languages},
year = {1994},
pages = {446--457},
publisher = {ACM Press}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We show that any monad whose unit and extension operations are expressible as purely functional terms can be embedded in a call-by-value language with "composable continuations". As part of the development, we extend Meyer and Wand's characterization of the relationship between continuation-passing and direct style to one for continuation-passing vs. general "monadic" style. We further show that the composablecontinuations construct can itself be represented using ordinary, non-composable first-class continuations and a single piece of state. Thus, in the presence of two specific computational effects -- storage and escapes -- any expressible monadic structure (e.g., nondeterminism as represented by the list monad) can be added as a purely definitional extension, without requiring a reinterpretation of the whole language. The paper includes an implementation of the construction (in Standard ML with some New Jersey extensions) and several examples. 1 Introduction 1.1 Background and o...
Keyphrases
single piece composablecontinuations construct composable continuation specific computational effect storage definitional extension list monad direct style standard ml whole language new jersey extension expressible monadic structure several example purely functional term general monadic style continuation-passing v call-by-value language non-composable first-class continuation extension operation
