Computational effects and operations: An overview

Electronic Notes in Theoretical Computer Science

Volumn 73, Issue , 2004, Pages 149-163

  Plotkin, Gordon ^a   Power, John ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Computational effects; Enriched Lawvere theories; Generic effects; Modularity; Monads; Operational semantics; Operations

Indexed keywords

ALGEBRA; COMPUTER PROGRAMMING LANGUAGES; FUNCTION EVALUATION; INPUT OUTPUT PROGRAMS; INTERACTIVE COMPUTER SYSTEMS; LOGIC PROGRAMMING; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; PROBABILISTIC LOGICS; SEMANTICS;

COMPUTATIONAL EFFECTS; ENRICHED LAWVERE THEORIES; GENERIC EFFECTS; MODULARITY; MONADS; OPERATIONAL SEMANTICS; OPERATIONS;

COMPUTATION THEORY;

EID: 18944361993     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.08.008     Document Type: Conference Paper

References (34)

1. M. Barr and C. Wells, Category Theory for Computing Science, Prentice-Hall, 1990.
2. M. Barr and C. Wells, Toposes, Triples, and Theories, Grundlehren der mathematischen Wissenschaften 278, Springer-Verlag, 1984.
3. N. Benton, J. Hughes, and E. Moggi, Monads and Effects, APPSEM '00 Summer School, Lecture Notes in Computer Science 2395, 2002.
4. P. Cenciarelli and E. Moggi, A Syntactic Approach to Modularity in Denotational Semantics, CWI Technical Report, 1993.
5. P. Freyd, Algebra-Valued Functors in General and Tensor Products in Particular, Colloq. Math. Wroclaw, 14 (1966) 89-106.
6. M. Gordon, R. Milner and C. Wadsworth, Edinburgh LCF, Lecture Notes in Computer Science, 78 (1979), Berlin: Springer Verlag.
7. R. Heckmann, Probabilistic Domains, Proc. CAAP 94, Lecture Notes in Computer Science 136 21-56.
8. M. Hennessy, Algebraic Theory of Processes, Cambridge, Massachussetts: MIT Press, 1988.
9. M. Hyland, G.D. Plotkin, and A.J. Power, Combining Computational Effects: Commutativity and Sum, Proc. IFIP Conference on Theoretical Computer Science (2002) 474-484.
10. M. Hyland, G.D. Plotkin, and A.J. Power, Combining effects: sum and tensor (submitted).
11. C. Jones, Probabilistic Non-Determinism, Ph.D. Thesis, University of Edinburgh, Report ECS-LFCS-90-105, 1990.
12. C. Jones and G. D. Plotkin, A Probabilistic Powerdomain of Evaluations, Proc. LICS 4 (1989) 186-195.
13. G. M. Kelly, Basic Concepts of Enriched Category Theory, Cambridge: Cambridge University Press, 1982.
14. G. M. Kelly and A. J. Power, Adjunctions whose Counits are Coequalisers, and Presentations of Finitary Enriched Monads, J. Pure Appl. Algebra 89 (1993) 163-179.
15. Y. Kinoshita, A. J. Power, and M. Takeyama, Sketches, J. Pure Appl. Algebra 143 (1999) 275-291.
16. M. Lenisa, A. J. Power, and H. Watanabe, Distributivity for Endofunctors, Pointed and Co-Pointed Endofunctors, Monads and Comonads, Proc. CMCS 2000 Electronic Notes in Thoeret. Comp. Sci. 33, 2000.
17. P. B. Levy, Call-by-Push-Value: A Subsuming Paradigm, Proc. TLCA 99, Lecture Notes in Computer Science 1581 228-242.
18. M. W. Mislove, Nondeterminism and Probabilistic Choice: Obeying the Laws, International Conference on Concurrency Theory (2000) 350-364, URL: citeseer.nj.nec.com/mislove00nondeterminism.html.
19. E. Moggi, Computational lambda-calculus and monads, Proc. LICS 89 (1989) 14-23.
20. E. Moggi, An abstract view of programming languages, University of Edinburgh, Report ECS-LFCS-90-113, 1989.
21. E. Moggi, Notions of computation and monads, Inf. and Comp. 93 (1991) 55-92.
22. E. Moggi, Representing Program Logics in Evaluation Logic, Unpublished manuscript, available electronically, 1994.
23. E. Moggi, A Semantics for Evaluation Logic, Fundamenta Informaticae, 22 (1/2), 1995.
24. A. M. Pitts, Evaluation Logic, G. Birtwistle (Ed.), IVth Higher Order Workshop, Banff, 1990, Workshops in Computing (Springer-Verlag, Berlin, 1991), pp 162-189.
25. G. D. Plotkin, A Powerdomain Construction, SIAM J. Comput. 5 (1976) 452-487.
26. G. D. Plotkin, Domains, http://www.dcs.ed.ac.uk/home/gdp/, 1983.
27. G. D. Plotkin and A. J. Power, Adequacy for Algebraic Effects, Proc. FOSSACS 2001, Lecture Notes in Computer Science 2030 1-24.
28. G. D. Plotkin and A. J. Power, Semantics for Algebraic Operations, Proc. MFPS 17, Electronic Notes in Thoeret. Comp. Sci. 45, 2001.
29. G. D. Plotkin and A. J. Power, Notions of Computation Determine Monads, Proc. FOSSACS 2002, Lecture Notes in Computer Science 2303 342-356.
30. A. J. Power, Enriched Lawvere Theories, Theory and Applications of Categories (2000) 83-93.
31. E. P. Robinson, Variations on Algebra: Monadicity and Generalisations of Equational Theories, Festshrift for Rod Burstall, Formal Aspects of Computing, 13 (3, 4 & 5) 308-326, 2002.
32. D. S. Scott, A Type-Theoretical Alternative to ISWIM, CUCH, OWHY, TCS 121 (1-2) 411-440, 1993.
33. D. Turi and G. D. Plotkin, Towards a Mathematical Operational Semantics, Proc. LICS 12 (1997) 280-291.
34. D. Varacca, The Powerdomain of Indexed Valuations, Proc. LICS 17 (2002) 299-310.