Monads and composable continuations
- 1 January 1994
- journal article
- Published by Springer Nature in Higher-Order and Symbolic Computation
- Vol. 7 (1) , 39-55
- https://doi.org/10.1007/bf01019944
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Imperative functional programmingPublished by Association for Computing Machinery (ACM) ,1993
- Representing Control: a Study of the CPS TransformationMathematical Structures in Computer Science, 1992
- The essence of functional programmingPublished by Association for Computing Machinery (ACM) ,1992
- Typing first-class continuations in MLPublished by Association for Computing Machinery (ACM) ,1991
- Abstracting controlPublished by Association for Computing Machinery (ACM) ,1990
- The theory and practice of first-class promptsPublished by Association for Computing Machinery (ACM) ,1988
- Revised 3 report on the algorithmic language schemeACM SIGPLAN Notices, 1986
- Principal type-schemes for functional programsPublished by Association for Computing Machinery (ACM) ,1982
- Call-by-name, call-by-value and the λ-calculusTheoretical Computer Science, 1975
- Definitional interpreters for higher-order programming languagesPublished by Association for Computing Machinery (ACM) ,1972