Combining effects: Sum and tensor

Theoretical Computer Science

Volumn 357, Issue 1-3, 2006, Pages 70-99

  Hyland, Martin ^a   Plotkin, Gordon ^b   Power, John ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Computational effect; Lawvere theory; Modularity; Monad

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; ELECTRIC TRANSFORMERS; MATHEMATICAL MODELS; TENSORS;

COMPUTATIONAL EFFECT; LAWVERE THEORY; MODULARITY; MONAD;

INFORMATION THEORY;

EID: 33745348813     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.03.013     Document Type: Article

References (58)

1. S. Abramsky, Experiments, powerdomains and fully abstract models for applicative multiprogramming, in: M. Karpinski (Ed.), Proc. of the FCT, Lecture Notes in Computer Science, Vol. 158, 1983, pp. 1-13.
2. Abramsky S. A domain equation for bisimulation. Inform. and Comput. 92 2 (1991) 161-218
3. J. Adámek, J. Rosický, Locally Presentable and Accessible Categories, London Mathematical Society Lecture Note Series, Vol. 189, Cambridge University Press, Cambridge, MA, 1994.
4. M.S. Ager, O. Danvy, J. Midtgaard, A functional correspondence between monadic evaluators and abstract machines for languages with computational effects, BRICS Technical Report, RS-03-35, Department of Computer Science, Aarhus University, 2003, available at 〈http://www.brics.dk/RS/03/Abs/BRICS-RS-03-Abs/BRICS-RS-03-Abs.html〉.
5. Barr M., and Wells C. Toposes, Triples and Theories (1985), Springer, Berlin
6. Barr M., and Wells C. Category Theory for Computing Science (1990), Prentice-Hall, Englewood Cliffs, NJ
7. N. Benton, J. Hughes, E. Moggi, Monads and effects, in: G. Barthe, P. Dybjer, L. Pinto, J. Saraiva (Eds.), APPSEM '00 Summer School, 2000, Lecture Notes in Computer Science, Vol. 2395, Springer, Berlin, 2000, pp. 42-122.
8. Bird R. Introduction to Functional Programming Using Haskell (1998), Prentice-Hall, Englewood Cliffs, NJ
9. P. Cenciarelli, E. Moggi, A syntactic approach to modularity in denotational semantics, in: Proc. Fifth. Biennial Meeting on Category Theory and Computer Science, CWI Technical Report, 1993.
10. M. Escardó, A. Simpson, A universal characterization of the closed euclidean interval (extended abstract), in: Proc. of the LICS '01, IEEE Press, New York, 2001, pp. 115-125.
11. A. Filinski, Representing layered monads, in: Proc. of the 26th POPL, ACM Press, New York, 1999, pp. 175-188.
12. M.P. Fiore, A. Jung, E. Moggi, P. O'Hearn, J. Riecke, G. Rosolini, I. Stark, Domains and denotational semantics: history, accomplishments and open problems, in Bull. EATCS (59) (1996) 227-256.
13. Freyd P.J. Algebra-valued functors in general and tensor products in particular. Colloq. Math. Wroclaw 14 (1966) 89-106
14. N. Gambino, M. Hyland, Wellfounded trees and dependent polynomial functors, in: S. Berardi, M. Coppo, F. Damiani (Eds.), Proc. of the TYPES 2003, Lecture Notes in Computer Science, Vol. 3085, Springer, Berlin, 2004, pp. 210-225.
15. G. Gierz, K.H. Hofmann, K. Keimel, J.D. Lawson, M. Mislove, D.S. Scott, Continuous Lattices and Domains, Encyclopedia of Mathematics, Vol. 93, Cambridge University Press, Cambridge, MA, 2003.
16. R. Heckmann, Probabilistic domains, in: Proc. of the CAAP '94, Lecture Notes in Computer Science, Vol. 136, Springer, Berlin, 1994, pp. 21-56.
17. Hennessy M.C.B. Algebraic Theory of Processes (1988), MIT Press, Cambridge, MA
18. M.C.B. Hennessy, G.D. Plotkin, Full abstraction for a simple parallel programming language, in: J. Bečvář (Ed.), Proc. of the MFCS '79, Lecture Notes in Computer Science, Vol. 74, Springer, Berlin, 1979, pp. 108-120.
19. J.M.E. Hyland, A.J. Power, Pseudo-commutative monads, in: Proc. of the MFPS XVII, Electronic Notes in Theoretical Computer Science, Vol. 45, Elsevier, Amsterdam, 2001.
20. J.M.E. Hyland, A.J. Power, Two-dimensional linear algebra, in: Proc. of the CMCS 2001, Electronic Notes in Theoretical Computer Science, Vol. 47, Elsevier, Amsterdam, 2001.
21. Hyland J.M.E., and Power A.J. Pseudo-commutative monads and pseudo-closed 2-categories. J. Pure Appl. Algebra 175 1-3 (2002) 141-185
22. C. Jones, Probabilistic non-determinism, Ph.D. Thesis, University of Edinburgh, Report ECS-LFCS-90-105, 1990.
23. C. Jones, G.D. Plotkin, A probabilistic powerdomain of evaluations, in: Proc. of the LICS '89, IEEE Press, New York, 1989, pp. 186-195.
24. M. Jones, L. Duponcheel, Composing monads, Technical Report YALEU/DCS/RR-1004, Department of Computer Science, Yale University, 1993.
25. Kelly G.M. A unified treatment of transfinite constructions for free algebras, Free monoids, colimits, associated sheaves, and so on. Bull. Austral. Math. Soc. 22 (1980) 1-83
26. Kelly G.M. Basic Concepts of Enriched Category Theory (1982), Cambridge University Press, Cambridge, MA
27. Kelly G.M. Structures defined by finite limits in the enriched context I. Cahiers de Topologie et Géom. Différentielle 23 1 (1982) 3-42
28. Kelly G.M., and Power A.J. Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads. J. Pure Appl. Algebra 89 (1993) 163-179
29. D.J. King, P. Wadler, Combining monads, in: J. Launchbury, P.M. Samson (Eds.), Proc. 1992 Glasgow Workshop on Functional Programming, Workshops in Computing, Springer, Berlin, 1992, pp. 134-143.
30. Kinoshita Y., Power A.J., and Takeyama M. Sketches. J. Pure Appl. Algebra 143 (1999) 275-291
31. Kock A. Monads on symmetric monoidal closed categories. Arch. Math. 21 (1970) 1-10
32. H. König, Theory and applications of superconvex spaces, Aspects of Positivity in Functional Analysis, North-Holland Mathematics Studies, Vol. 122, North-Holland, Amsterdam, 1986, pp. 79-118.
33. F.W. Lawvere, Functorial semantics of algebraic theories and some algebraic problems in the context of functorial semantics of algebraic theories, Ph.D. Thesis, Columbia University, 1963, and in Reports of the Midwest Category Seminar II, 1968, pp. 41-61 and reprinted in 〈http://www.tac.mta.ca/tac/reprints/articles/5/tr5abs.html〉, Theory Appl. Categories (5) (2004) 1-121.
34. E.G. Manes, Algebraic Theories, Graduate Texts in Mathematics, Vol. 26, Springer, Berlin, 1976.
35. Milne G., and Milner R. Concurrent processes and their syntax. J. Assoc. Comput. Mach. 26 2 (1979) 302-321
36. Milner R. Communication and Concurrency (1989), Prentice-Hall, New York
37. M.W. Mislove, Nondeterminism and probabilistic choice: obeying the laws, in: C. Palamidessi (Ed.), Proc. of the CONCUR 2000, Lecture Notes in Computer Science, Vol. 1877, Springer, Berlin, 2000, pp. 350-364.
38. Moerdijk I., and Palmgren E. Wellfounded trees in categories. Ann. Pure Appl. Logic 104 1-3 (2000) 189-218
39. E. Moggi, Computational lambda-calculus and monads, in: Proc. of the LICS '89, IEEE Press, New York, 1989, pp. 14-23.
40. E. Moggi, An abstract view of programming languages, Report ECS-LFCS-90-113, University of Edinburgh, 1989.
41. Moggi E. Notions of computation and monads. Inform. and Comput. 93 1 (1991) 55-92
42. Plotkin G.D. A powerdomain construction. SIAM J. Comput. 5 3 (1976) 452-487
43. G.D. Plotkin, Domains, 1983, available at 〈http://homepages.inf.ed.ac.uk/gdp/publications〉.
44. G.D. Plotkin, A.J. Power, Adequacy for algebraic effects, in: F. Honsell, M. Miculan (Eds.), Proc. of the FOSSACS 2001, Lecture Notes in Computer Science, Vol. 2030, Springer, Berlin, 2001, pp. 1-24.
45. G.D. Plotkin, A.J. Power, Semantics for algebraic operations (extended abstract), in: S. Brookes, M. Mislove (Eds.), Proc. of the MFPS XVII, Electronic Notes in Theoretical Computer Science, Vol. 45, Elsevier, Amsterdam, 2001.
46. G.D. Plotkin, A.J. Power, Notions of computation determine monads, in: M. Nielsen, U. Engberg (Eds.), Proc. of the FOSSACS '02, Lecture Notes in Computer Science, Vol. 2303, Springer, Berlin, 2002, pp. 342-356.
47. Plotkin G.D., and Power A.J. Algebraic operations and generic effects. Applied Categorical Structures 11 1 (2003) 69-94
48. Power A.J. Why tricategories?. Inform. and Comput. 120 2 (1995) 251-262
49. A.J. Power, Modularity in denotational semantics, in: S. Brookes, M. Mislove (Eds.), Proc. of the MFPS XIII, Electronic Notes in Theoretical Computer Science, Vol. 6, Elsevier, Amsterdam, 1997.
50. Power A.J. Enriched Lawvere theories. Theory Appl. Categories 6 (2000) 83-93
51. A.J. Power, E.P. Robinson, Modularity and dyads, in: S. Brookes, A. Jung, M. Mislove, A. Scedrov (Eds.), Proc. of the MFPS XV, Electronic Notes in Theoretical Computer Science, Vol. 20, Elsevier, Amsterdam, 1999.
52. A.J. Power, G. Rosolini, A modular approach to denotational semantics, in: Proc. of the ICALP 98, Lecture Notes in Computer Science, Vol. 1443, 1998, pp. 351-362.
53. E. Robinson, Variations on algebra: monadicity and generalisations of equational theories, in: A Festschrift for Professor Rod Burstall, TACS, Vol. 13, Nos. 3, 4 and 5, 2002, pp. 308-326.
54. Schubert H. Categories (1972), Springer, Berlin
55. A. Simpson, G.D. Plotkin, Complete axioms for categorical fixed-point operators, in: Proc. 15th. Symp. on Logic in Computer Science, IEEE Computer Society Press, Silver Sping, MD, 2000, pp. 30-41.
56. Street R. The formal theory of monads. J. Pure Appl. Algebra 2 (1972) 149-168
57. R. Tix, Continuous D-cones: convexity and powerdomain constructions, Ph.D. Thesis, Technische Universitat Darmstadt, Shaker Verlag, Aachen, 1999.
58. R. Tix, K. Keimel, G. Plotkin, Semantic Domains for Combining Probability and Non-Determinism, Electronic Notes in Theoretical Computer Science, Vol. 129, Elsevier, Amsterdam, 2005, pp. 1-104.