Iteration-free PDL with intersection: a complete axiomatisation, Fundamenta Informaticae, vol.45, pp.173-194, 2001. ,
DOI : 10.3166/jancl.13.231-276
Game Logic is strong enough for parity games, Studia Logica, vol.75, issue.2, pp.205-219, 2003. ,
DOI : 10.1023/A:1027358927272
Modal Logic -An Introduction, 1980. ,
DOI : 10.1017/cbo9780511621192
Modal Logics are Coalgebraic, The Computer Journal, vol.54, issue.1, 2008. ,
DOI : 10.1093/comjnl/bxp004
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.2957
Propositional dynamic logic of regular programs, Journal of Computer and System Sciences, vol.18, issue.2, pp.194-211, 1979. ,
DOI : 10.1016/0022-0000(79)90046-1
A relatively complete generic Hoare logic for orderenriched effects, Proceedings of LICS 2013, pp.273-282, 2013. ,
DOI : 10.1109/lics.2013.33
Monotonic modal logic (Master's thesis), 2003. ,
A Coalgebraic Perspective on Monotone Modal Logic, Proceedings of CMCS 2004, pp.121-143, 2004. ,
DOI : 10.1016/j.entcs.2004.02.028
URL : http://doi.org/10.1016/j.entcs.2004.02.028
Strong Completeness for Iteration-Free Coalgebraic Dynamic Logics, Tech. rep, 2014. ,
DOI : 10.1007/978-3-662-44602-7_22
URL : https://hal.archives-ouvertes.fr/hal-01402072
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
URL : http://arxiv.org/abs/0901.4430
Dynamic Logic, 2000. ,
Generic weakest precondition semantics from monads enriched with order, Proceedings of CMCS 2014, 2014. ,
DOI : 10.1007/978-3-662-44124-4_2
URL : https://hal.archives-ouvertes.fr/hal-01408750
New Directions in Categorical Logic, for Classical, Probabilistic and Quantum Logic, Logical Methods in Computer Science, vol.11, issue.3, 2014. ,
DOI : 10.2168/LMCS-11(3:24)2015
Dijkstra Monads in Monadic Computation, Proceedings of CMCS 2014, 2014. ,
DOI : 10.1007/978-3-662-44124-4_8
Stone Spaces, 1982. ,
Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads, Journal of Pure and Applied Algebra, vol.89, issue.1-2, pp.163-179, 1993. ,
DOI : 10.1016/0022-4049(93)90092-8
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
Strongly Complete Logics for Coalgebras, Logical Methods in Computer Science, vol.8, issue.3, p.14, 2012. ,
DOI : 10.2168/LMCS-8(3:14)2012
URL : http://arxiv.org/abs/1207.2732
Some Aspects of Equational Categories, Proceedings of the Conference on Categorical Algebra, pp.84-94, 1966. ,
DOI : 10.1007/978-3-642-99902-4_3
Categories for the Working Mathematician, 1998. ,
Algebraic Theories, 1976. ,
DOI : 10.1007/978-1-4612-9860-1
Free completely distributive lattices, Proceedings of the American Mathematical Society, vol.74, issue.2, pp.227-228, 1979. ,
DOI : 10.1090/S0002-9939-1979-0524290-9
Notions of computation and monads, Information and Computation, vol.93, issue.1, 1991. ,
DOI : 10.1016/0890-5401(91)90052-4
The Logic of Games and its Applications, Topics in the Theory of Computation. No. 14 in Annals of Discrete Mathematics, 1985. ,
DOI : 10.1016/S0304-0208(08)73078-0
Game Logic: An overview, Studia Logica, vol.75, issue.2, pp.165-182, 2003. ,
DOI : 10.1023/A:1027354826364
Semantics for Algebraic Operations, Proceedings of MFPS XVII. ENTCS, 2001. ,
DOI : 10.1016/S1571-0661(04)80970-8
URL : http://doi.org/10.1016/s1571-0661(04)80970-8
Universal coalgebra: a theory of systems, Theoretical Computer Science, vol.249, issue.1, pp.3-80, 2000. ,
DOI : 10.1016/S0304-3975(00)00056-6
Expressivity of coalgebraic modal logic: The limits and beyond, Theoretical Computer Science, vol.390, issue.2-3, pp.230-247, 2008. ,
DOI : 10.1016/j.tcs.2007.09.023
PSPACE bounds for rank-1 modal logics, ACM Transactions on Computational Logics, vol.10, issue.2, pp.13-14, 2009. ,
Strong completeness of coalgebraic modal logics, Proceedings of STACS 2009, pp.673-684, 2009. ,