Hints in Unification, Lecture Notes in Computer Science, vol.1, issue.1, pp.84-98, 2009. ,
DOI : 10.1007/BFb0028402
Canonical Big Operators, TPHOLs, pp.86-101, 2008. ,
DOI : 10.1007/3-540-44659-1_29
URL : https://hal.archives-ouvertes.fr/inria-00331193
Formalized algebraic numbers: construction and first order theory, 2012. ,
URL : https://hal.archives-ouvertes.fr/pastel-00780446
Generic Proof Tools and Finite Group Theory, 2011. ,
URL : https://hal.archives-ouvertes.fr/pastel-00649586
Packaging Mathematical Structures, TPHOLs, pp.327-342, 2009. ,
DOI : 10.1007/978-3-540-68103-8_11
URL : https://hal.archives-ouvertes.fr/inria-00368403
A Constructive Algebraic Hierarchy in Coq, Journal of Symbolic Computation, vol.34, issue.4, pp.271-286, 2002. ,
DOI : 10.1006/jsco.2002.0552
Point-Free, Set-Free Concrete Linear Algebra, ITP, pp.103-118, 2011. ,
DOI : 10.1017/S0956796802004501
URL : https://hal.archives-ouvertes.fr/hal-00805966
A Modular Formalisation of Finite Group Theory, TPHOLs, pp.86-101, 2007. ,
DOI : 10.1007/978-3-540-74591-4_8
URL : https://hal.archives-ouvertes.fr/inria-00139131
A Small Scale Reflection Extension for the Coq system ,
URL : https://hal.archives-ouvertes.fr/inria-00258384
How to make ad hoc proof automation less ad hoc, pp.163-175, 2011. ,
Fun with phantom types, The Fun of Programming, Cornerstones of Computing, pp.245-262, 2003. ,
DOI : 10.1007/978-1-349-91518-7_12
Constructive category theory, Proof, Language, and Interaction, pp.239-276, 2000. ,
Typing algorithm in type theory with inheritance, POPL, pp.292-301, 1997. ,
Outils Génériques de Modélisation et de Démonstration pour la Formalisation des Mathématiques en Théorie des Types: applicationàapplicationà la Théorie des Catégories, 1999. ,
First-Class Type Classes, Theorem Proving in Higher Order Logics, 21th International Conference, pp.278-293, 2008. ,
DOI : 10.1007/11542384_8
URL : https://hal.archives-ouvertes.fr/inria-00628864
Type classes for mathematics in type theory, Mathematical Structures in Computer Science, vol.2, issue.04, pp.795-825, 2011. ,
DOI : 10.1007/3-540-48256-3_10
How to make ad-hoc polymorphism less ad hoc, Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '89, pp.60-76, 1989. ,
DOI : 10.1145/75277.75283