1. Abramsky, S., & Shah, N. (2018). Relating structure and power: Comonadic semantics for computational resources. In 27th EACSL Annual Conference on Computer Science Logic (CSL 2018). Leibniz International Proceedings in Informatics (LIPIcs) (Vol. 119, pp. 2:1–2:17).
2. Awodey, S. (2010). Category Theory (2nd ed.). New York: Oxford University Press Inc.
3. Beck, J. (1969). Distributive laws. In B. Eckmann (Ed.), Seminar on triples and categorical homology theory (pp. 119–140). Berlin: Springer.
4. Bojańczyk, M. (2015). Recognisable languages over monads. arXiv:1502.04898.
5. Bojańczyk, M., & Klin, B. (2019). A non-regular language of infinite trees that is recognizable by a sort-wise finite algebra. Logical Methods in Computer Science,15(4).