Abstract
We introduce the notion of discrete countable Lawvere V-theory and study constructions that may be made on it. The notion of discrete countable Lawvere V-theory extends that of ordinary countable Lawvere theory by allowing the homsets of an ordinary countable Lawvere theory to become homobjects of a well-behaved axiomatically defined category such as that of ω-cpo’s. Every discrete countable Lawvere V-theory induces a V-enriched monad, equivalently a strong monad, on V. We show that discrete countable Lawvere V-theories allow us to model all the leading examples of computational effects other than continuations, and that they are closed under constructions of sum, tensor and distributive tensor, which are the fundamental ways in which one combines such effects. We also show that discrete countable Lawvere V-theories are closed under taking an image, allowing one to treat observation as a mathematical primitive in modelling effects.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adámek, J., Rosický, J.: Locally Presentable and Accessible Categories. London Mathematical Society Lecture Note Series, vol. 189. Cambridge University Press, Cambridge (1994)
Barr, M., Wells, C.: Toposes, Triples and Theories. Springer, Heidelberg (1985)
Barr, M., Wells, C.: Category Theory for Computing Science. Prentice-Hall, Englewood Cliffs (1990)
Blackwell, R., Kelly, G.M., Power, A.J.: Two-Dimensional Monad Theory. J. Pure Appl. Algebra 59, 1–41 (1989)
Ghani, N., Lüth, C.: Monads and Modular Term Rewriting. In: Moggi, E., Rosolini, G. (eds.) CTCS 1997. LNCS, vol. 1290, pp. 69–86. Springer, Heidelberg (1997)
Heckmann, R.: Probabilistic Domains. In: Tison, S. (ed.) CAAP 1994. LNCS, vol. 787, pp. 21–56. Springer, Heidelberg (1994)
Hennessy, M.C.B.: Algebraic Theory of Processes. MIT Press, Cambridge (1988)
Hyland, M., Levy, P., Plotkin, G.D., Power, A.J.: Combining Continuations with Other Effects. In: Proc. Continuations Workshop 2004, Birmingham Technical Report, No. CSR-04-1, refereed presentation (2004)
Hyland, J.M.E., Power, A.J.: Pseudo-Commutative Monads and Pseudo-Closed 2-Categories. J. Pure Appl. Algebra 175, 141–185 (2002)
Hyland, J.M.E., Power, A.J., Plotkin, G.D.: Combining Computational Effects: Commutativity and Sum. In: Baeza-Yates, R.A., Montanari, U., Santoro, N. (eds.) Proc. 2nd IFIP Conf on Theoretical Computer Science, pp. 474–484. Kluwer, Dordrecht (2002)
Hyland, J.M.E., Power, A.J., Plotkin, G.D.: Combining Computational Effects: Sum and Tensor. Theoretical Computer Science (to appear)
Jones, C., Plotkin, G.D.: A Probabilistic Powerdomain of Evaluations. In: Proc. LICS 1989, pp. 186–195. IEEE Press, Los Alamitos (1989)
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, 1–83 (1980)
Kelly, G.M.: Basic Concepts of Enriched Category Theory. Cambridge University Press, Cambridge (1982)
Kelly, G.M.: Structures Defined by Finite Limits in the Enriched Context I. Cahiers de Topologie et Géométrie Différentielle 23(1), 3–42 (1982)
Kelly, G.M., Lack, S.: Finite-product-preserving Functors, Kan Extensions, and Strongly-finitary Monads. Applied Categorical Structures (1993)
Kelly, G.M., Power, A.J.: Adjunctions whose Counits are Coequalizers, and Presentations of Finitary Enriched Monads. J. Pure Appl. Algebra 89, 163–179 (1993)
Kinoshita, Y., Power, A.J., Takeyama, M.: Sketches. J. Pure Appl. Algebra 143, 275–291 (1999)
Kock, A.: Monads on Symmetric Monoidal Closed Categories. Arch. Math. 21, 1–10 (1970)
Mislove, M.W.: Nondeterminism and Probabilistic Choice: Obeying the Laws. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 350–364. Springer, Heidelberg (2000)
Moggi, E.: Computational Lambda-Calculus and Monads. In: Proc. LICS 1989, pp. 14–23. IEEE Press, Los Alamitos (1989)
Moggi, E.: Notions of Computation and Monads. Inf. and Comp 93(1), 55–92 (1991)
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)
Power, A.J.: Why Tricategories? Information and Computation 120, 251–262 (1995)
Power, A.J.: Enriched Lawvere Theories. Theory and Applications of Categories 6, 83–93 (2000)
Power, A.J.: Canonical models for computational effects. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol. 2987, pp. 438–452. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Power, J. (2005). Discrete Lawvere Theories. In: Fiadeiro, J.L., Harman, N., Roggenbach, M., Rutten, J. (eds) Algebra and Coalgebra in Computer Science. CALCO 2005. Lecture Notes in Computer Science, vol 3629. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11548133_22
Download citation
DOI: https://doi.org/10.1007/11548133_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28620-2
Online ISBN: 978-3-540-31876-7
eBook Packages: Computer ScienceComputer Science (R0)