Domain theory in logical form*, Annals of Pure and Applied Logic, vol.51, issue.1-2, pp.1-77, 1991. ,
DOI : 10.1016/0168-0072(91)90065-T
Formal certification of code-based cryptographic proofs, Principles of Programming Languages, pp.90-101, 2009. ,
DOI : 10.1145/1480881.1480894
Quantum weakest preconditions, Mathematical Structures in Computer Science, vol.16, issue.03, pp.429-451, 2006. ,
DOI : 10.1017/S0960129506005251
Predicate Calculus and Program Semantics, 1990. ,
DOI : 10.1007/978-1-4612-3228-5
New Trends in Quantum Structures, 2000. ,
DOI : 10.1007/978-94-017-2422-7
Linearly-Used Continuations in the Enriched Effect Calculus, Foundations of Software Science and Computation Structures, number 6014 in Lect. Notes Comp. Sci, pp.18-32, 2010. ,
DOI : 10.1007/978-3-642-12032-9_3
Effect algebras and unsharp quantum logics. Found, Physics, vol.24, issue.10, pp.1331-1352, 1994. ,
DOI : 10.1007/bf02283036
From Kleisli categories to commutative C * -algebras: Probabilistic Gelfand duality, Conference on Algebra and Coalgebra in Computer Science number 8089 in Lect. Notes Comp. Sci, pp.141-157, 2009. ,
DOI : 10.1007/978-3-642-40206-7_12
The Mathematical Language of Quantum Theory. From Uncertainty to Entanglement, 2012. ,
Convexity, Duality and Effects, IFIP Adv. in Inf. and Comm. Techn, pp.1-19, 2010. ,
DOI : 10.1007/978-3-642-15240-5_1
URL : https://hal.archives-ouvertes.fr/hal-01054454
Introduction to coalgebra. Towards mathematics of states and observations . Book, in preparation, 2012. ,
DOI : 10.1017/cbo9781316823187
New directions in categorical logic, for classical, probabilistic and quantum logic. See arxiv.org/abs/1205, 2012. ,
DOI : 10.2168/lmcs-11(3:24)2015
Measurable Spaces and Their Effect Logic, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013. ,
DOI : 10.1109/LICS.2013.13
Coreflections in algebraic quantum logic. Found, Physics, vol.42, issue.7, pp.932-958, 2012. ,
The expectation monad in quantum foundations, Quantum Physics and Logic (QPL) 2011, volume 95 of Elect. Proc. in Theor. Comp. Sci, pp.143-182, 2012. ,
DOI : 10.1016/j.ic.2016.02.009
Preframe presentations present, Como Conference on Category Theory, number 1488 in Lect. Notes Math, pp.193-212, 1991. ,
DOI : 10.1017/S1446788700012209
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.6000
Ordinal sums and equational doctrines Seminar on Triples and Categorical Homology Theory, number 80 in Lect, Notes Math, pp.141-155, 1969. ,
Monad transformers and modular interpreters, Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '95, pp.333-343, 1995. ,
DOI : 10.1145/199448.199528
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.268
A triple theoretic construction of compact algebras, Seminar on Triples and Categorical Homolgy Theory, number 80 in Lect. Notes Math, pp.91-118, 1969. ,
DOI : 10.1090/S0002-9939-1960-0117716-1
Categorical duality theory: With applications to domains, convexity, and the distribution monad, Leibniz Int. Proc. in Informatics, pp.500-520, 2013. ,
Categories for the Working Mathematician, 1971. ,
DOI : 10.1007/978-1-4612-9839-7
Linearly-Used State in Models of Call-by-Value, Conference on Algebra and Coalgebra in Computer Science (CALCO 2011), number 6859 in Lect. Notes Comp. Sci, pp.293-313, 2011. ,
DOI : 10.1007/978-3-642-22944-2_21
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
Ynot: dependent types for imperative programs, International Conference on Functional Programming (ICFP), pp.229-240, 2008. ,
Computational Effects and Operations: An Overview, Proc. of the Workshop on Domains VI, number 73 in Elect. Notes in Theor. Comp. Sci, pp.149-163, 2004. ,
DOI : 10.1016/j.entcs.2004.08.008
URL : http://doi.org/10.1016/j.entcs.2004.08.008
Representation theorem for convex effect algebras, pp.645-659, 1998. ,
Postulates for the barycentric calculus, Annali di Matematica Pura ed Applicata, Series 4, vol.29, issue.1, pp.25-30, 1949. ,
DOI : 10.1007/BF02413910
Verifying higher-order programs with the Dijkstra monad, Proc. of the 34th ACM SIG- PLAN conf. on Programming language design and implementation (PLDI), pp.387-398, 2013. ,
DOI : 10.1145/2491956.2491978
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.4136
A Hoare Logic for the State Monad, Theorem Proving in Higher Order Logics, number 5674 in Lect. Notes Comp. Sci, pp.440-451, 2009. ,
DOI : 10.1007/978-3-540-74591-4_23