Concurrency and the algebraic theory of effects

Authors:
Gordon D. Plotkin
Affiliations:
LFCS, School of Informatics, University of Edinburgh, UK
Venue:
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Year:
2012

Citing 6
Cited 0

Computational lambda-calculus and monads

Proceedings of the Fourth Annual Symposium on Logic in computer science
Notions of computation and monads

Information and Computation
Notions of Computation Determine Monads

FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Monads and Effects

Applied Semantics, International Summer School, APPSEM 2000, Caminha, Portugal, September 9-15, 2000, Advanced Lectures
Combining effects: sum and tensor

Theoretical Computer Science - Clifford lectures and the mathematical foundations of programming semantics
Handlers of Algebraic Effects

ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009

Quantified Score

Hi-index	0.00

Visualization

Abstract

The algebraic theory of effects [7,8,4] continues Moggi's monadic approach to effects [5,6,1] by concentrating on a particular class of monads: the algebraic ones, that is, the free algebra monads of given equational theories. The operations of such equational theories can be thought of as effect constructors, as it is they that give rise to effects. Examples include exceptions (when the theory is that of a set of constants with no axioms), nondeterminism (when the theory could be that of a semilattice, for nondeterminism, with a zero, for deadlock), and action (when the theory could be a set of unary operations with no axioms).