1. Proofs of randomized algorithms in Coq;Audebaud,2006
2. M. Escardó, A. Simpson, A universal characterization of the closed euclidean interval (extended abstract), in: Proc. of 16th Ann. IEEE Symp. on Logic in Computer Science, LICS 2001 Boston, MA, June 2001, IEEE CS Press, Los Alamitos, CA, pp. 115–125
3. The Why Verification Tool;Filliâtre,2002
4. Verification of non-functional programs using interpretations in type theory;Filliâtre;J. Funct. Programming,2003
5. Constructive reals in Coq: Axioms and categoricity;Geuvers,2002