Skip to main content

Concurrency and the Algebraic Theory of Effects

(Abstract)

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7454)

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).

Keywords

  • Equational Theory
  • Unary Operation
  • Algebraic Theory
  • Free Algebra
  • Evident Theory

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Benton, N., Hughes, J., Moggi, E.: Monads and Effects. In: Barthe, G., Dybjer, P., Pinto, L., Saraiva, J. (eds.) APPSEM 2000. LNCS, vol. 2395, pp. 42–122. Springer, Heidelberg (2002)

    CrossRef  Google Scholar 

  2. Bergstra, J.A., Klop, J.W.: Algebra of communicating processes with abstraction. Theor. Comput. Sci. 37, 77–121 (1985)

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. Cenciarelli, P., Moggi, E.: A syntactic approach to modularity in denotational semantics. In: Proc. 5th. Biennial Meeting on Category Theory and Computer Science. CWI Technical report (1993)

    Google Scholar 

  4. Hyland, M., Plotkin, G., Power, J̇.: Combining effects: sum and tensor. Theor. Comput. Science 357(1-3), 70–99 (2006)

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. Moggi, E.: Computational lambda-calculus and monads. In: Proc. 4th. LICS, pp. 14–23. IEEE Press (1989)

    Google Scholar 

  6. Moggi, E.: Notions of computation and monads. Inf. and Comp. 93(1), 55–92 (1991)

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. Plotkin, G., Power, J.: Notions of Computation Determine Monads. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol. 2303, pp. 342–356. Springer, Heidelberg (2002)

    CrossRef  Google Scholar 

  8. Plotkin, G., Power, J.: Algebraic operations and generic effects. Appl. Categor. Struct. 11(1), 69–94 (2003)

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. Plotkin, G., Pretnar, M.: Handlers of Algebraic Effects. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol. 5502, pp. 80–94. Springer, Heidelberg (2009)

    CrossRef  Google Scholar 

  10. van Glabbeek, R., Plotkin, G.: On CSP and the algebraic theory of effects. In: Jones, C.B., Roscoe, A.W., Wood, K.R. (eds.) Reflections on the work of C.A.R. Hoare, pp. 333–370. Springer (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Plotkin, G.D. (2012). Concurrency and the Algebraic Theory of Effects. In: Koutny, M., Ulidowski, I. (eds) CONCUR 2012 – Concurrency Theory. CONCUR 2012. Lecture Notes in Computer Science, vol 7454. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32940-1_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32940-1_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32939-5

  • Online ISBN: 978-3-642-32940-1

  • eBook Packages: Computer ScienceComputer Science (R0)