Representing layered monads
Author:
Open Access
- 1 January 1999
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 175-188
Abstract
There has already been considerable research on constructingmodular, monad-based specications of computationaleects (state, exceptions, nondeterminism, etc.) in programminglanguages. We present a simple framework in this tradition,based on a Church-style eect-typing system for anML-like language. The semantics of this language is formallydened by a series of monadic translations, each oneexpanding away a layer of eects. Such a layered specicationis easy to reason about, but its...Keywords
This publication has 21 references indexed in Scilit:
- State in HaskellHigher-Order and Symbolic Computation, 1995
- A generalization of exceptions and control in ML-like languages1995
- Monad transformers and modular interpreters1995
- The Scheme of thingsACM SIGPLAN Lisp Pointers, 1992
- Representing Control: a Study of the CPS TransformationMathematical Structures in Computer Science, 1992
- Control delimiters and their hierarchiesHigher-Order and Symbolic Computation, 1990
- Abstract continuations: a mathematical semantics for handling full jumps1988
- Continuation-based multiprocessing1980
- LCF considered as a programming languageTheoretical Computer Science, 1977
- On the Relation between Direct and Continuation Semantics1974