Exploring the Boundaries of Monad Tensorability on Set
Author(s): Bowler N, Goncharov S, Levy P, Schröder L
Publisher: IfCoLog (International Federation of Computational Logic) / Technical University of Braunschweig
Publication year: 2013
Journal issue: 3:22
Pages range: 1-18
We study a composition operation on monads, equivalently presented as large equational theories. Specifically, we discuss the existence of tensors, which are combinations of theories that impose mutual commutation of the operations from the component theories. As such, they extend the sum of two theories, which is just their unrestrained combination. Tensors of theories arise in several contexts; in particular, in the semantics of programming languages, the monad transformer for global state is given by a tensor. We present two main results: we show that the tensor of two monads need not in general exist by presenting two counterexamples, one of them involving finite powerset (i.e. the theory of join semilattices); this solves a somewhat long-standing open problem, and contrasts with recent results that had ruled out previously expected counterexamples. On the other hand, we show that tensors with bounded powerset monads do exist from countable powerset upwards. © N. Bowler, S. Goncharov, P. B. Levy, and L. Schröder.
FAU Authors / FAU Editors How to cite
APA: Bowler, N., Goncharov, S., Levy, P., & Schröder, L. (2013). Exploring the Boundaries of Monad Tensorability on Set. Logical Methods in Computer Science, 9(3:22), 1-18. https://dx.doi.org/10.2168/LMCS-9(3:22)2013
MLA: Bowler, Nathan, et al. "Exploring the Boundaries of Monad Tensorability on Set." Logical Methods in Computer Science 9.3:22 (2013): 1-18.