Monads and composable continuations

Philip Wadler

doi:10.1007/BF01019944

Monads and composable continuations

Philip Wadler

Research output: Contribution to journal › Article › peer-review

Abstract

Moggi's use of monads to factor semantics is used to model the composable continuations of Danvy and Filinski. This yields some insights into the type systems proposed by Murthy and by Danvy and Filinski. Interestingly, modelling some aspects of composable continuations requires a structure that is almost, but not quite, a monad.

Original language	English
Pages (from-to)	39-55
Number of pages	17
Journal	LISP and Symbolic Computation
Volume	7
Issue number	1
DOIs	https://doi.org/10.1007/BF01019944
Publication status	Published - 1994

Access to Document

10.1007/BF01019944

http://dx.doi.org/10.1007/BF01019944

Cite this

@article{5fd478e478a149d5a9cb3990c294a432,

title = "Monads and composable continuations",

abstract = "Moggi's use of monads to factor semantics is used to model the composable continuations of Danvy and Filinski. This yields some insights into the type systems proposed by Murthy and by Danvy and Filinski. Interestingly, modelling some aspects of composable continuations requires a structure that is almost, but not quite, a monad.",

author = "Philip Wadler",

year = "1994",

doi = "10.1007/BF01019944",

language = "English",

volume = "7",

pages = "39--55",

journal = "LISP and Symbolic Computation",

issn = "0892-4635",

publisher = "Kluwer Academic Publishers",

number = "1",

}

TY - JOUR

T1 - Monads and composable continuations

AU - Wadler, Philip

PY - 1994

Y1 - 1994

N2 - Moggi's use of monads to factor semantics is used to model the composable continuations of Danvy and Filinski. This yields some insights into the type systems proposed by Murthy and by Danvy and Filinski. Interestingly, modelling some aspects of composable continuations requires a structure that is almost, but not quite, a monad.

AB - Moggi's use of monads to factor semantics is used to model the composable continuations of Danvy and Filinski. This yields some insights into the type systems proposed by Murthy and by Danvy and Filinski. Interestingly, modelling some aspects of composable continuations requires a structure that is almost, but not quite, a monad.

U2 - 10.1007/BF01019944

DO - 10.1007/BF01019944

M3 - Article

SN - 0892-4635

VL - 7

SP - 39

EP - 55

JO - LISP and Symbolic Computation

JF - LISP and Symbolic Computation

IS - 1

ER -

Monads and composable continuations

Abstract

Access to Document

Fingerprint

Cite this