Varieties of Effects

  • Carsten Führmann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2303)


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. 1.
    Anna Bucalo, Carsten Führmann, and Alex Simpson. An equational notion of lifting monad. Theoretical Computer Science, to appear.Google Scholar
  2. 2.
    Andrzej Filinski. Recursion from iteration. Lisp and Symbolic Computation,, 7(1):11–38, 1994.CrossRefGoogle Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    Carsten Führmann. The structure of call-by-value. PhD thesis, Division of Informatics, University of Edinburgh, 2000.Google Scholar
  5. 5.
    Masahito Hasegawa and Yoshihiko Kakutani. Axioms for recursion in call-by-value. Higher-Order and Symbolic Computation, To appear.Google Scholar
  6. 6.
    A. Kock. Strong functors and monoidal monads. Archive der Mathematik, 23:113–120, 1972.zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    E. Moggi. Computational lambda-calculus and monads. Technical Report ECSLFCS-88-66, Edinburgh Univ., Dept. of Comp. Sci., 1988.Google Scholar
  8. 8.
    E. Moggi. Notions of computation and monads. Information and Computation, 93(1), 1991.Google Scholar
  9. 9.
    Flemming Nielson, Hanne Riis Nielson, and Chris Hankin. Principles of Program Analysis. Springer-Verlag, 1999.Google Scholar
  10. 10.
    John Power and Edmund Robinson. Premonoidal categories and notions of computation. Mathematical Structures in Computer Science, 7(5):453–468, October 1997.zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Peter Selinger. Control categories and duality: on the categorical semantics of the lambda-mu calculus. Mathematical Structures in Computer Science, 11:207–260, 2001.zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Hayo Thielecke. Categorical Structure of Continuation Passing Style. PhD thesis, University of Edinburgh, 1997.Google Scholar
  13. 13.
    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.zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Carsten Führmann
    • 1
  1. 1.School of Computer ScienceUniversity of BirminghamBirmingham

Personalised recommendations