Varieties of effects (2002)
by
Carsten Führmann
| Venue: | In Foundations of Software Science and Computation Structures, volume 2303 of LNCS |
| Citations: | 11 - 1 self |
BibTeX
@INPROCEEDINGS{Führmann02varietiesof,
author = {Carsten Führmann},
title = {Varieties of effects},
booktitle = {In Foundations of Software Science and Computation Structures, volume 2303 of LNCS},
year = {2002},
pages = {144--158},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. We introduce the notion of effectoid as a way of axiomatising the notion of “computational effect”. Guided by classical algebra, we define several effectoids equationally and explore their relationship with each other. We demonstrate their computational relevance by applying them to global exceptions, partiality, continuations, and global state. 1
Citations
| 651 | Notions of computation and monads - Moggi - 1991 |
| 458 | Principles of program analysis - Nielson, Nielson, et al. - 1999 |
| 401 | Computational lambda-calculus and monads - Moggi - 1989 |
| 89 | Premonoidal categories and notions of computation - Power, Robinson - 1997 |
| 74 | Control categories and duality: on the categorical semantics of the lambda-mu calculus - Selinger |
| 60 | Categorical Structure of Continuation Passing Style - Thielecke - 1997 |
| 40 | Strong functors and monoidal monads - Kock - 1972 |
| 11 | The Structure of Call-by-Value - Fuhrmann - 2000 |
| 11 | Using a continuation twice and its implications for the expressive power of call/cc - Thielecke - 1999 |
| 10 | Recursion from iteration - Filinski - 1994 |
| 7 | Direct models of the computational lambdacalculus - Führmann - 1999 |
| 3 | An equational notion of lifting monad - Bucalo, Führmann, et al. |
| 3 | and Yoshihiko Kakutani. Axioms for recursion in call-by-value - Hasegawa - 2002 |
