References

  1. Steve Awodey (2010): Category Theory. Oxord University Press.
  2. Andrej Bauer (2019): What is algebraic about algebraic effects and handlers?. ArXiv:1807.05923.
  3. Jon Beck (1969): Distributive laws. In: B. Eckmann: Seminar on Triples and Categorical Homology Theory. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 119–140, doi:10.1007/BFb0083084.
  4. Gabriella Böhm, Stephen Lack & Ross Street (2011): On the 2-Categories of Weak Distributive Laws. Communications in Algebra 39(12), pp. 4567–4583, doi:10.1080/00927872.2011.616436.
  5. F. Bonchi, A. Sokolova & V. Vignudelli (2019): The Theory of Traces for Systems with Nondeterminism and Probability. In: 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pp. 1–14, doi:10.1109/LICS.2019.8785673.
  6. Filippo Bonchi & Alessio Santamaria (2021): Combining Semilattices and Semimodules. In: Stefan Kiefer & Christine Tasson: Foundations of Software Science and Computation Structures. Springer International Publishing, Cham, pp. 102–123, doi:10.1109/LICS.2019.8785707. Available at https://arxiv.org/abs/2012.14778.
  7. Filippo Bonchi, Alexandra Silva & Ana Sokolova (2017): The Power of Convex Algebras. In: Roland Meyer & Uwe Nestmann: 28th International Conference on Concurrency Theory (CONCUR 2017), Leibniz International Proceedings in Informatics (LIPIcs) 85. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, pp. 23:1–23:18, doi:10.4230/LIPIcs.CONCUR.2017.23. Available at http://drops.dagstuhl.de/opus/volltexte/2017/7796.
  8. Richard Garner (2020): The Vietoris monad and weak distributive laws. Applied Categorical Structures 28(2), pp. 339–354, doi:10.1007/s10485-019-09582-w. Available at https://arxiv.org/abs/1811.00214.
  9. Alexandre Goy & Daniela Petrişan (2020): Combining Probabilistic and Non-Deterministic Choice via Weak Distributive Laws. In: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '20. Association for Computing Machinery, New York, NY, USA, pp. 454464, doi:10.1145/3373718.3394795.
  10. Alexandre Goy, Daniela Petrişan & Marc Aiguier (2021): Powerset-Like Monads Weakly Distribute over Themselves in Toposes and Compact Hausdorff Spaces. In: Nikhil Bansal, Emanuela Merelli & James Worrell: 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Leibniz International Proceedings in Informatics (LIPIcs) 198. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, pp. 132:1–132:14, doi:10.4230/LIPIcs.ICALP.2021.132. Available at https://drops.dagstuhl.de/opus/volltexte/2021/14201.
  11. Martin Hyland & Christine Tasson (2021): The linear-non-linear substitution 2-monad. In: David I. Spivak & Jamie Vicary: Proceedings of the 3rd Annual International Applied Category Theory Conference 2020, Cambridge, USA, 6-10th July 2020, Electronic Proceedings in Theoretical Computer Science 333. Open Publishing Association, pp. 215–229, doi:10.4204/EPTCS.333.15. Available at https://arxiv.org/abs/2005.09559.
  12. Klaus Keimel & Gordon D. Plotkin (2017): Mixed powerdomains for probability and nondeterminism. Logical Methods in Computer Science Volume 13, Issue 1, doi:10.23638/LMCS-13(1:2)2017. Available at https://lmcs.episciences.org/2665.
  13. G.M. Kelly (1980): A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on. Bulletin of the Australian Mathematical Society 22(1), pp. 183, doi:10.1017/S0004972700006353.
  14. Bartek Klin & Julian Salamanca (2018): Iterated Covariant Powerset is not a Monad. Electronic Notes in Theoretical Computer Science 341, pp. 261–276, doi:10.1016/j.entcs.2018.11.013. Available at https://www.sciencedirect.com/science/article/pii/S157106611830094X. Proceedings of the Thirty-Fourth Conference on the Mathematical Foundations of Programming Semantics (MFPS XXXIV).
  15. Saunders Mac Lane (1971): Categories for the Working Mathematician, 2nd edition. Springer-Verlag, doi:10.1007/978-1-4757-4721-8.
  16. Matteo Mio, Ralph Sarkis & Valeria Vignudelli (2021): Combining Nondeterminism, Probability, and Termination: Equational and Metric Reasoning. In: 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), pp. 1–14, doi:10.1109/LICS52264.2021.9470717. Available at https://arxiv.org/abs/2012.00382.
  17. Michael Mislove (2000): Nondeterminism and Probabilistic Choice: Obeying the Laws. In: Catuscia Palamidessi: CONCUR 2000 — Concurrency Theory. Springer Berlin Heidelberg, Berlin, Heidelberg, pp. 350–365, doi:10.1007/3-540-44618-4_26.
  18. Emily Riehl (2017): Category Theory in Context. Dover Publications. Available at http://www.math.jhu.edu/~eriehl/context.pdf.
  19. Ross Street (2009): Weak distributive laws.. Theory and Applications of Categories [electronic only] 22, pp. 313–320. Available at http://eudml.org/doc/233565.
  20. Miki Tanaka (2004): Pseudo-distributive laws and a unified framework for variable binding. Laboratory for the Foundations of Computer Science, School of Informatics, University of Edinburgh. Available at https://www.lfcs.inf.ed.ac.uk/reports/04/ECS-LFCS-04-438/ECS-LFCS-04-438.pdf.
  21. Daniele Varacca (2003): Probability, nondeterminism and concurrency: two denotational models for probabilistic computation. BRICS. Available at https://www.brics.dk/DS/03/14/BRICS-DS-03-14.pdf.
  22. Daniele Varacca & Glynn Winskel (2006): Distributing probability over non-determinism. Mathematical Structures in Computer Science 16(1), pp. 87113, doi:10.1017/S0960129505005074.
  23. Maaike Zwart & Dan Marsden (2019): No-Go Theorems for Distributive Laws. In: 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, BC, Canada, June 24-27, 2019. IEEE, pp. 1–13, doi:10.1109/LICS.2019.8785707. Available at https://ieeexplore.ieee.org/xpl/conhome/8765678/proceeding.
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org