1. Barthe, G., Capretta, V., Pons, O.: Setoids in type theory. J. of Functional Programming 13(2), 261–293 (2003); Special Issue on Logical Frameworks and Metalanguages
2. Bostan, A.: Algorithmique efficace pour des opérations de base en Calcul formel. Ph.D. thesis, École polytechnique (2003),
http://algo.inria.fr/bostan/these/These.pdf
3. Cohen, C.: Types quotients en COQ. In: Hermann (ed.) Actes des 21éme Journées Francophones des Langages Applicatifs (JFLA 2010), INRIA, Vieux-Port La Ciotat, France (January 2010),
http://jfla.inria.fr/2010/actes/PDF/cyrilcohen.pdf
4. Cohen, C., Coquand, T.: A constructive version of Laplace’s proof on the existence of complex roots,
http://hal.inria.fr/inria-00592284/PDF/laplace.pdf
(unpublished)
5. Cohen, C., Mahboubi, A.: Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination. Logical Methods in Computer Science 8(1-02), 1–40 (2012),
http://hal.inria.fr/inria-00593738