Abstract
Moggi famously proposed a monadic account of computational effects [Mog89, Mog91, BHM02]; this account includes the computational λ-calculus, a core call-by-value functional programming language. Moggi endowed the computational λ-calculus with an effect-oriented denotational semantics by taking the denotations of terms to be morphisms in the Kleisli category of the monad. The question naturally then arises as to whether one can give a correspondingly general treatment of operational semantics.
In the algebraic theory of effects [PP02, PP04, HPP06], a refinement of Moggi’s theory, the effects are obtained by appropriate operations, and Moggi’s monad is then generated by an equational theory over these operations. In a previous paper with John Power [PP01] we gave a general adequacy theorem for the computational λ-calculus for the case of monads generated by finitary operations. This covers examples such as (probabilistic) nondeterminism and exceptions. The main idea is to evaluate terms symbolically in the absolutely free algebra with the same signature as the equational theory. Without recursion, the evaluated terms are finite; with recursion, they may be infinitely deep.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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)
Hyland, J.M.E., Plotkin, G.D., Power, A.J.: Combining effects: sum and tensor. In: Artemov, S., Mislove, M. (eds.) Clifford Lectures and the Mathematical Foundations of Programming Semantics. TCS, vol. 357(1-3), pp. 70–99 (2006)
Milner, A.J.R.G.: A Calculus of Communicating Systems. Springer, Heidelberg (1980)
Moggi, E.: Computational lambda-calculus and monads. In: Proc. 3rd. LICS, pp. 14–23. IEEE Press, Los Alamitos (1989)
Moggi, E.: Notions of computation and monads. Inf. & Comp. 93(1), 55–92 (1991)
Plotkin, G.D., Power, A.J.: Adequacy for algebraic effects. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol. 2030, pp. 1–24. Springer, Heidelberg (2001)
Plotkin, G.D., Power, A.J.: Notions of Computation Determine Monads. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol. 2303, pp. 342–356. Springer, Heidelberg (2002)
Plotkin, G.D., Power, A.J.: Computational effects and operations: an overview. In: Escardó, M., Jung, A. (eds.) Proc. Workshop on Domains VI. ENTCS, vol. 73, pp. 149–163. Elsevier, Amsterdam (2004)
Plotkin, G.D., Power, A.J.: Tensors of comodels and models for operational semantics. In: Proc. MFPS XXIV. ENTCS, vol. 218, pp. 295–311. Elsevier, Amsterdam (2008)
Plotkin, G.D., Pretnar, M.: Handlers of algebraic effects. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol. 5502, pp. 80–94. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Plotkin, G. (2009). Adequacy for Infinitary Algebraic Effects (Abstract). In: Kurz, A., Lenisa, M., Tarlecki, A. (eds) Algebra and Coalgebra in Computer Science. CALCO 2009. Lecture Notes in Computer Science, vol 5728. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03741-2_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-03741-2_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03740-5
Online ISBN: 978-3-642-03741-2
eBook Packages: Computer ScienceComputer Science (R0)