Discrete Lawvere theories and computational effects

Theoretical Computer Science

Volumn 366, Issue 1-2, 2006, Pages 144-162

  Hyland, Martin ^a   Power, John ^b  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^b UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Countable Lawvere V theory; Discrete countable Lawvere V theory; Distributive tensor; Image; Model; Sum; Tensor

Indexed keywords

IMAGE PROCESSING; MATHEMATICAL MODELS; PROBABILISTIC LOGICS; RECURSIVE FUNCTIONS; TENSORS;

COUNTABLE LAWVERE V-THEORY; DISCRETE COUNTABLE LAWVERE V-THEORY; DISTRIBUTIVE TENSOR; DISTRIBUTIVE TENSORS; LAWVERE THEORIES; SUM;

COMPUTATIONAL METHODS;

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

References (36)

1. Adámek J., and Rosický J. Locally Presentable and Accessible Categories. London Mathematical Society Lecture Note Series Vol. 189 (1994), Cambridge University Press, Cambridge
2. Barr M., and Wells C. Toposes, Triples and Theories (1985), Springer, Berlin
3. Barr M., and Wells C. Category Theory for Computing Science (1990), Prentice-Hall, Englewood Cliffs, NJ
4. Blackwell R., Melly G.M., and Power A.J. Two-dimensional Monad theory. J. Pure Appl. Algebra 59 (1989) 1-41
5. N. Ghani, C. Lüth, Monads and modular term rewriting, in: Proc. CTCS '97, Lecture Notes in Computer Science, Vol. 1290, Springer, Berlin, 1997, pp. 69-86.
6. R. Heckmann, Probabilistic domains, in: Proc. CAAP '94, Lecture Notes in Computer Science, Vol. 136, Springer, Berlin, 1994, pp. 21-56.
7. Hennessy M.C.B. Algebraic Theory of Processes (1988), MIT Press, Cambridge, MA
8. Hennessy M.C.B., and Plotkin G.D. Full abstraction for a simple parallel programming language. In: Becvar J. (Ed). Proc. MFCS '79, Lecture Notes in Computer Science Vol. 74 (1979), Springer, Berlin 108-120
9. Hyland J.M.E., Plotkin G.D., and Power A.J. Combining computational effects: commutativity and sum. In: Baeza-Yates R.A., Montanari U., and Santoro N. (Eds). Proc. Second IFIP Conf. on Theoretical Computer Science (2002), Kluwer, Dordrecht 474-484
10. Hyland J.M.E., Plotkin G.D., and Power A.J. Combining effects: sum and tensor. Theoret. Comput. Sci. 357 (2006) 70-99
11. Hyland J.M.E., and Power A.J. Pseudo-commutative monads and pseudo-closed 2-categories. J. Pure Appl. Algebra 175 (2002) 141-185
12. M. Hyland, P. Levy, G.D. Plotkin, A.J. Power, Combining Continuations with Other Effects, submitted for publication.
13. C. Jones, Probabilistic non-determinism, Ph.D. Thesis, University of Edinburgh, Report ECS-LFCS-90-105, 1990.
14. Jones C., and Plotkin G.D. A probabilistic powerdomain of evaluations. Proc. LICS '89 (1989), IEEE Press, Silver Spring, MD 186-195
15. 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
16. Kelly G.M. Basic Concepts of Enriched Category Theory (1982), Cambridge University Press, Cambridge
17. Kelly G.M. Structures defined by finite limits in the enriched context I. Cahiers Topol. Géométrie Différentielle 23 1 (1982) 3-42
18. Kelly G.M., and Lack S. Finite-product-preserving functors, Kan extensions, and strongly-finitary monads. Appl. Categorical Struct. 1 (1993) 84-94
19. 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
20. Kinoshita Y., Power A.J., and Takeyama M. Sketches. J. Pure Appl. Algebra 143 (1999) 275-291
21. Kock A. Monads on symmetric monoidal closed categories. Arch. Math. 21 (1970) 1-10
22. Meseguer J. Varieties of chain-complete algebras. J. Pure Appl. Algebra 19 (1980) 347-383
23. Mislove M.W. Nondeterminism and probabilistic choice: obeying the laws. In: Palamidessi C. (Ed). Proc. CONCUR 2000, Lecture Notes in Computer Science Vol. 1877 (2000), Springer, Berlin 350-364
24. Moggi E. Computational lambda-calculus and monads. Proc. LICS '89 (1989), IEEE Press, Silver Spring, MD 14-23
25. Moggi E. Notions of computation and monads. Inform. and Comput. 93 1 (1991) 55-92
26. Plotkin G.D. A powerdomain construction. SIAM J. Comput. 5 3 (1976) 452-487
27. G.D. Plotkin, Domains, URL: 〈http://www.dcs.ed.ac.uk/home/gdp〉, 1983.
28. Plotkin G.D., and Power A.J. Adequacy for algebraic effects. In: Honsell F., and Miculan M. (Eds). Proc. FOSSACS 2001, Lecture Notes in Computer Science Vol. 2030 (2001), Springer, Berlin 1-24
29. Plotkin G.D., and Power A.J. Semantics for algebraic operations extended abstract. In: Brookes S., and Mislove M. (Eds). Proc. MFPS XVII, Electronic Notes in Theoretical Computer Science Vol. 45 (2001), Elsevier, Amsterdam
30. Plotkin G.D., and Power A.J. Notions of computation determine monads. In: Nielsen M., and Engberg U. (Eds). Proc. FOSSACS '02, Lecture Notes in Computer Science Vol. 2303 (2002), Springer, Berlin 342-356
31. Power A.J. Why tricategories. Inform. and Comput. 120 (1995) 251-262
32. Power A.J. Enriched Lawvere theories. Theory Appl. Categories 6 (2000) 83-93
33. A.J. Power, Canonical models for computational effects, in: Proc. FOSSACS 2004, Lecture Notes in Computer Science, Vol. 2987, Springer, Berlin, 2004, pp. 438-452.
34. A.J. Power, Discrete Lawvere theories, in: Proc. CALCO 2005, Lecture Notes in Computer Science, Vol. 3629, Springer, Berlin, 2005, pp. 348-363.
35. R. Tix, Continuous D-cones: convexity and powerdomain constructions, Ph.D. Thesis, Technische Universitat Darmstadt, 1999.
36. Tix R., Keimel K., and Plotkin G. Semantic domains for combining probability and non-determinism. Electron. Notes Theoret. Comput. Sci. 129 (2005) 1-104