J. Adámek, S. Milius, N. Bowler, and P. Levy, Coproducts of monads on set, Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, LICS 2012, pp.45-54, 2012.

J. C. Baeten, T. Basten, and M. A. Reniers, Process Algebra: Equational Theories of Communicating Processes. Cambridge Tracts in Theoretical Computer Science, 2009.

J. C. Baeten and C. Verhoef, Handbook of logic in computer science, chapter Concrete Process Algebra, vol.4, pp.149-268, 1995.

J. A. Bergstra and J. W. Klop, Process algebra for synchronous communication, Information and Control, vol.60, issue.1, pp.109-137, 1984.

L. Stephen, Z. Bloom, and . Ésik, Free shuffle algebras in language varieties, Theoretical Computer Science, vol.163, issue.1, pp.55-98, 1996.

A. Bruguières and A. Virelizier, Hopf monads. Advances in Mathematics, vol.215, issue.2, pp.679-733, 2007.

P. Cenciarelli and E. Moggi, A syntactic approach to modularity in denotational semantics. Category Theory and Computer Science, 1993.

F. Dahlqvist and R. Neves, Compositional semantics for new paradigms: probabilistic, hybrid and beyond, 2018.

R. Garner and I. L. Franco, Commutativity. Journal of Pure and Applied Algebra, vol.220, issue.5, pp.1707-1751, 2016.

S. Goncharov, Kleene monads, 2010.

S. Goncharov and L. Schröder, A coinductive calculus for asynchronous side-effecting processes, Inf. Comput, vol.231, pp.204-232, 2013.

S. Goncharov and L. Schröder, A relatively complete generic Hoare logic for orderenriched effects, Proc. 28th Annual Symposium on Logic in Computer Science (LICS 2013), pp.273-282, 2013.

S. Goncharov, L. Schröder, and T. Mossakowski, Kleene monads: Handling iteration in a framework of generic effects, Algebra and Coalgebra in Computer Science, vol.5728, pp.18-33, 2009.

I. Hasuo, Generic weakest precondition semantics from monads enriched with order, Theoretical Computer Science, vol.604, issue.C, pp.2-29, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01408750

C. A. Hoare, A. Hussain, B. Möller, P. W. O'hearn, G. Rasmus-lerchedahl-petersen et al., On locality and the exchange law for concurrent processes, CONCUR 2011 -Concurrency Theory, pp.250-264, 2011.

C. A. Hoare, B. Möller, G. Struth, and I. Wehrman, Concurrent Kleene algebra, CONCUR 2009 -Concurrency Theory, pp.399-414, 2009.
DOI : 10.1007/978-3-642-04081-8_27
URL : https://opus.bibliothek.uni-augsburg.de/opus4/files/1301/TR_2009_04.pdf

C. A. Hoare, B. Möller, G. Struth, and I. Wehrman, Concurrent Kleene algebra and its foundations, The Journal of Logic and Algebraic Programming, vol.80, issue.6, pp.266-296, 2011.
DOI : 10.1016/j.jlap.2011.04.005
URL : https://doi.org/10.1016/j.jlap.2011.04.005

J. Hughes and B. Jacobs, Simulations in coalgebra, Theoretical Computer Science, vol.327, issue.1, pp.71-108, 2004.

M. Hyland, G. Plotkin, and J. Power, Combining effects: Sum and tensor, Clifford Lectures and the Mathematical Foundations of Programming Semantics, vol.357, issue.1, pp.70-99, 2006.
DOI : 10.1016/j.tcs.2006.03.013
URL : https://doi.org/10.1016/j.tcs.2006.03.013

T. Shin-ya-katsumata and . Sato, Preorders on monads and coalgebraic simulations, Foundations of Software Science and Computation Structures, pp.145-160, 2013.

A. Kock, Strong functors and monoidal monads, Archiv der Mathematik, vol.23, pp.113-120, 1970.
DOI : 10.1007/bf01304852

E. G. Manes, Algebraic theories. Applied Mathematical Sciences, 1976.

E. Manes and P. Mulry, Monad compositions I: general constructions and recursive distributive laws, vol.18, pp.172-208, 2007.

E. Moggi, Notions of computation and monads, Inf. Comput, vol.93, issue.1, pp.55-92, 1991.
DOI : 10.1016/0890-5401(91)90052-4
URL : https://doi.org/10.1016/0890-5401(91)90052-4

W. Peter, . O'hearn, L. Rasmus, J. Petersen, A. Villard et al., On the relation between concurrent separation logic and concurrent Kleene algebra, 13th International Conference on Relational and Algebraic Methods in Computer Science, vol.84, pp.285-302, 2012.

G. Plotkin and J. Power, Algebraic operations and generic effects, vol.11, pp.69-94, 2003.

E. Rivas, M. Jaskelioff, and T. Schrijvers, A unified view of monadic and applicative non-determinism, Science of Computer Programming, vol.152, issue.C, pp.70-98, 2018.
DOI : 10.1016/j.scico.2017.09.007
URL : https://lirias.kuleuven.be/bitstream/123456789/594000/1/main.pdf

S. Doaitse, A. Swierstra, and . Dijkstra, Parse your options, Essays Dedicated to Rinus Plasmeijer on the Occasion of His 61st Birthday on The Beauty of Functional Code, vol.8106, pp.234-249, 2013.

T. Uustalu, A divertimento on monadplus and nondeterminism, Oliveira on the occasion of his 60th birthday, vol.85, pp.1086-1094, 2016.
DOI : 10.1016/j.jlamp.2016.06.004

P. Wadler, Comprehending monads, ACM Conference on LISP and Functional Programming, LFP '90, pp.61-78, 1990.
DOI : 10.1017/s0960129500001560
URL : https://www.pure.ed.ac.uk/ws/files/7944776/Comprehending_monads.pdf