Publisher
Springer International Publishing
Reference26 articles.
1. Altenkirch, T., Chapman, J., Uustalu, T.: Monads need not be endofunctors. Log. Methods Comput. Sci 11(1), 3:1–3:40 (2015). https://doi.org/10.2168/lmcs-11(1:3)2015
2. Dorsch, U., Milius, S., Schröder, L.: Graded monads and graded logics for the linear time - branching time spectrum. In: Fokkink, W., van Glabbeek, R. (eds.) Proc. of 30th Int. Conf. on Concurrency Theory, CONCUR 2019, Leibniz Int. Proc. in Informatics, vol. 140, pp. 36:1–36:16. Dagstuhl Publishing, Saarbrücken/Wadern (2019). https://doi.org/10.4230/lipics.concur.2019.36
3. Fritz, T., Perrone, P.: A probability monad as the colimit of spaces of finite samples. Theor. Appl. Categ. 34(7), 170–220 (2019). http://www.tac.mta.ca/tac/volumes/34/7/34-07abs.html
4. Lecture Notes in Computer Science;S Fujii,2016
5. Lecture Notes in Computer Science;M Gaboardi,2021
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The formal theory of relative monads;Journal of Pure and Applied Algebra;2024-09
2. Effectful Semantics in 2-Dimensional Categories: Premonoidal and Freyd Bicategories;Electronic Proceedings in Theoretical Computer Science;2023-12-14
3. Additive Cellular Automata Graded-Monadically;International Symposium on Principles and Practice of Declarative Programming;2023-10-22
4. Modular Models of Monoids with Operations;Proceedings of the ACM on Programming Languages;2023-08-30
5. When Programs Have to Watch Paint Dry;Lecture Notes in Computer Science;2023