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.
Chapter PDF
Similar content being viewed by others
References
Anna Bucalo, Carsten Führmann, and Alex Simpson. An equational notion of lifting monad. Theoretical Computer Science, to appear.
Andrzej Filinski. Recursion from iteration. Lisp and Symbolic Computation,, 7(1):11–38, 1994.
Carsten Führmann. Direct models of the computational lambda-calculus. In Proceedings MFPS XV, volume 20 of Electronic Notes in Theoretical Computer Science, New Orleans, 1999. Elsevier.
Carsten Führmann. The structure of call-by-value. PhD thesis, Division of Informatics, University of Edinburgh, 2000.
Masahito Hasegawa and Yoshihiko Kakutani. Axioms for recursion in call-by-value. Higher-Order and Symbolic Computation, To appear.
A. Kock. Strong functors and monoidal monads. Archive der Mathematik, 23:113–120, 1972.
E. Moggi. Computational lambda-calculus and monads. Technical Report ECSLFCS-88-66, Edinburgh Univ., Dept. of Comp. Sci., 1988.
E. Moggi. Notions of computation and monads. Information and Computation, 93(1), 1991.
Flemming Nielson, Hanne Riis Nielson, and Chris Hankin. Principles of Program Analysis. Springer-Verlag, 1999.
John Power and Edmund Robinson. Premonoidal categories and notions of computation. Mathematical Structures in Computer Science, 7(5):453–468, October 1997.
Peter Selinger. Control categories and duality: on the categorical semantics of the lambda-mu calculus. Mathematical Structures in Computer Science, 11:207–260, 2001.
Hayo Thielecke. Categorical Structure of Continuation Passing Style. PhD thesis, University of Edinburgh, 1997.
Hayo Thielecke. Using a continuation twice and its implications for the expressive power of call/cc. Higher-Order and Symbolic Computation, 12(1):47–74, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Führmann, C. (2002). Varieties of Effects. In: Nielsen, M., Engberg, U. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2002. Lecture Notes in Computer Science, vol 2303. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45931-6_11
Download citation
DOI: https://doi.org/10.1007/3-540-45931-6_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43366-8
Online ISBN: 978-3-540-45931-6
eBook Packages: Springer Book Archive