Countable Lawvere Theories and Computational Effects

Abstract Lawvere theories have been one of the two main category theoretic formulations of universal algebra, the other being monads. Monads have appeared extensively over the past fifteen years in the theoretical computer science literature, specifically in connection with computational effects, but Lawvere theories have not. So we define the notion of (countable) Lawvere theory and give a precise statement of its relationship with the notion of monad on the category Set . We illustrate with examples arising from the study of computational effects, explaining how the notion of Lawvere theory keeps one closer to computational practice. We then describe constructions that one can make with Lawvere theories, notably sum, tensor, and distributive tensor, reflecting the ways in which the various computational effects are usually combined, thus giving denotational semantics for the combinations.

[1]  Reinhold Heckmann,et al.  Probabilistic Domains , 1994, CAAP.

[2]  M. Barr,et al.  Toposes, Triples and Theories , 1984 .

[3]  G. M. Kelly,et al.  Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads , 1993 .

[4]  W.Peter Weijland.  Algebraic theory of processes : By M. Hennessy. MIT Press, Cambridge, MA, 1988, Price £16.95 (paperback), ISBN 0-262-08171-7.☆ , 1989 .

[5]  Gordon D. Plotkin,et al.  Computational Effects and Operations: An Overview , 2004, Electron. Notes Theor. Comput. Sci..

[6]  Gordon D. Plotkin,et al.  Algebraic Operations and Generic Effects , 2003, Appl. Categorical Struct..

[7]  Donald Yau,et al.  Categories , 2021, 2-Dimensional Categories.

[8]  S. Lane.  Categories for the Working Mathematician , 1971 .

[9]  S. Eilenberg,et al.  Adjoint functors and triples , 1965 .

[10]  Gordon D. Plotkin,et al.  Semantics for Algebraic Operations , 2001, MFPS.

[11]  John Power,et al.  Pseudo-commutative monads and pseudo-closed 2-categories , 2002 .

[12]  John Power,et al.  Combining computational effects: commutativity and sum , 2001 .

[13]  P. Freyd,et al.  Algebra valued functors in general and tensor products in particular , 1966 .

[14]  John Power.  Enriched Lawvere Theories , .

[15]  John Power.  Canonical Models for Computational Effects , 2004, FoSSaCS.

[16]  Pietro Cenciarelli,et al.  A Syntactic Approach to Modularity in Denotational Semantics , 1993 .

[17]  Law Fw.  FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES. , 1963 .

[18]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[19]  Michael Barr,et al.  Category theory for computing science , 1995, Prentice Hall International Series in Computer Science.

[20]  Gordon D. Plotkin,et al.  Adequacy for Algebraic Effects , 2001, FoSSaCS.

[21]  Gordon D. Plotkin,et al.  Combining Computational Effects: commutativity & sum , 2002, IFIP TCS.

[22]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..

[23]  G. M. Kelly,et al.  BASIC CONCEPTS OF ENRICHED CATEGORY THEORY , 2022, Elements of ∞-Category Theory.

[24]  Gordon D. Plotkin,et al.  Notions of Computation Determine Monads , 2002, FoSSaCS.

[25]  Michael W. Mislove.  Nondeterminism and Probabilistic Choice: Obeying the Laws , 2000, CONCUR.

[26]  Gordon D. Plotkin,et al.  Combining effects: Sum and tensor , 2006, Theor. Comput. Sci..

[27]  Eugenio Moggi,et al.  Computational lambda-calculus and monads , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[28]  F. W. Lawvere,et al.  FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES. , 1963, Proceedings of the National Academy of Sciences of the United States of America.