M. Barr and C. Wells, Toposes, Triples and Theories, 1985.
DOI : 10.1007/978-1-4899-0021-0

S. Cattani and R. Segala, Decision Algorithms for Probabilistic Bisimulation*, Lecture Notes in Computer Science, vol.2421, pp.371-385, 2002.
DOI : 10.1007/3-540-45694-5_25

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

L. Cheung, Reconciling Nondeterministic and Probabilistic Choices, 2006.

C. C??rsteac??rstea, A coalgebraic approach to linear-time logics, FoSSaCS, 2014.

E. W. Dijkstra, A Discipline of Programming, 1976.

D. J. Foulis and M. K. Bennett, Effect algebras and unsharp quantum logics. Found, Physics, vol.24, issue.10, pp.1331-1352, 1994.
DOI : 10.1007/bf02283036

M. Giry, A categorical approach to probability theory, Lect. Notes Math, vol.915, pp.68-85, 1982.
DOI : 10.1007/BFb0092872

E. Grädel, W. Thomas, and T. Wilke, Automata, Logics, and Infinite Games: A Guide to Current Research, Lecture Notes in Computer Science, vol.2500, 2001.
DOI : 10.1007/3-540-36387-4

H. H. Hansen and C. Kupke, A Coalgebraic Perspective on Monotone Modal Logic, Electronic Notes in Theoretical Computer Science, vol.106, pp.121-143, 2004.
DOI : 10.1016/j.entcs.2004.02.028

H. H. Hansen, C. Kupke, and E. Pacuit, Neighbourhood Structures: Bisimilarity and Basic Model Theory, Logical Methods in Computer Science, vol.5, issue.2, 2009.
DOI : 10.2168/LMCS-5(2:2)2009

I. Hasuo, Generic Forward and Backward Simulations II: Probabilistic Simulation, Lect. Notes Comp. Sci, vol.6269, pp.447-461, 2010.
DOI : 10.1007/978-3-642-15375-4_31

I. Hasuo and N. Hoshino, Semantics of higher-order quantum computation via geometry of interaction, pp.237-246, 2011.

I. Hasuo, B. Jacobs, and A. Sokolova, Generic Trace Semantics via Coinduction, Logical Methods in Computer Science, vol.3, issue.4, p.11, 2007.
DOI : 10.2168/LMCS-3(4:11)2007

C. A. Hoare, An axiomatic basis for computer programming, Communications of the ACM, vol.12, issue.10, pp.576-580, 1969.
DOI : 10.1145/363235.363259

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

B. Jacobs, Categorical Logic and Type Theory, 1999.

B. Jacobs, New Directions in Categorical Logic, for Classical, Probabilistic and Quantum Logic, Logical Methods in Computer Science, vol.11, issue.3, 2013.
DOI : 10.2168/LMCS-11(3:24)2015

B. Jacobs, Measurable Spaces and Their Effect Logic, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.83-92, 2013.
DOI : 10.1109/LICS.2013.13

C. Jones, Probabilistic Non-Determinism, 1990.

M. Jurdzinski, Small Progress Measures for Solving Parity Games, STACS. Lecture Notes in Computer Science, vol.1770, pp.290-301, 2000.
DOI : 10.1007/3-540-46541-3_24

S. Katsumata, Relating computational effects by ??????-lifting, Information and Computation, vol.222, pp.228-246, 2013.
DOI : 10.1016/j.ic.2012.10.014

URL : http://dx.doi.org/10.1016/j.ic.2012.10.014

S. Katsumata and T. Sato, Preorders on Monads and Coalgebraic Simulations, FoSSaCS. Lecture Notes in Computer Science, vol.7794, pp.145-160, 2013.
DOI : 10.1007/978-3-642-37075-5_10

C. Kissig and Y. Venema, Complementation of Coalgebra Automata, Lect. Notes Comp. Sci, vol.204, issue.3, pp.81-96, 2009.
DOI : 10.1016/j.ic.2005.06.003

A. Kock, Monads and extensive quantities, 2011.

D. Kozen, Semantics of probabilistic programs, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), pp.328-350, 1981.
DOI : 10.1109/SFCS.1979.38

C. Kupke and D. Pattinson, Coalgebraic semantics of modal logics: An overview, Theoretical Computer Science, vol.412, issue.38, pp.5070-5094, 2011.
DOI : 10.1016/j.tcs.2011.04.023

C. Kupke and Y. Venema, Coalgebraic Automata Theory: Basic Results, Logical Methods in Computer Science, vol.4, issue.4, 2008.
DOI : 10.2168/LMCS-4(4:10)2008

URL : http://arxiv.org/abs/0811.1976

N. A. Lynch, R. Segala, and F. W. Vaandrager, Compositionality for Probabilistic Automata, Lect. Notes Comp. Sci, vol.2761, pp.204-222, 2003.
DOI : 10.1007/978-3-540-45187-7_14

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

M. Lane and S. , Categories for the Working Mathematician, 1998.
DOI : 10.1007/978-1-4612-9839-7

E. Moggi, Notions of computation and monads, Information and Computation, vol.93, issue.1, pp.55-92, 1991.
DOI : 10.1016/0890-5401(91)90052-4

URL : http://doi.org/10.1016/0890-5401(91)90052-4

C. Morgan, Programming from Specifications, 1990.

C. Morgan, A. Mciver, and K. Seidel, Probabilistic predicate transformers, ACM Transactions on Programming Languages and Systems, vol.18, issue.3, pp.325-353, 1996.
DOI : 10.1145/229542.229547

G. D. Plotkin and J. Power, Adequacy for Algebraic Effects, FoSSaCS. Lecture Notes in Computer Science, vol.2030, pp.1-24, 2001.
DOI : 10.1007/3-540-45315-6_1

A. Sokolova, Coalgebraic Analysis of Probabilistic Systems, 2005.

R. Tix, K. Keimel, and G. D. Plotkin, RETRACTED: Semantic Domains for Combining Probability and Non-Determinism, Electronic Notes in Theoretical Computer Science, vol.129, pp.1-104, 2005.
DOI : 10.1016/j.entcs.2004.06.063

D. Varacca and G. Winskel, Distributing probability over non-determinism, Mathematical Structures in Computer Science, vol.16, issue.01, pp.87-113, 2006.
DOI : 10.1017/S0960129505005074

Y. Venema and C. Kissig, Game bisimulations between basic positions. Talk at Highlights of Logic, Games and Automata, 2013.

G. Winskel, The Formal Semantics of Programming Languages, 1993.