Univalent categories and the Rezk completion, 2013. ,
Setoids in type theory, Journal of Functional Programming, vol.13, issue.02, pp.261-293, 2003. ,
DOI : 10.1017/S0956796802004501
URL : https://hal.archives-ouvertes.fr/hal-01124972
Proofs for free, Journal of Functional Programming, vol.83, issue.02, pp.107-152 ,
DOI : 10.1007/BFb0037116
Implementing Modules in the Coq System, TPHOLs, volume 2758 of LNCS, pp.270-286, 2003. ,
DOI : 10.1007/10930755_18
Pragmatic Quotient Types in Coq, Interactive Theorem Proving, pp.213-228, 2013. ,
DOI : 10.1007/978-3-642-39634-2_17
Isomorphism is Equality, 2013. Preprint ,
A Refinement Based Approach to Computational Algebra in Coq, Interactive Theorem Proving, pp.83-98, 2012. ,
A Small Scale Reflection Extension for the Coq system, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00258384
Proving Equalities in a Commutative Ring Done Right in Coq, pp.98-113, 2005. ,
DOI : 10.1007/11541868_7
URL : https://hal.archives-ouvertes.fr/hal-00819484
Data Refinement in Isabelle/HOL, Interactive Theorem Proving, 2013. ,
DOI : 10.1007/978-3-642-39634-2_10
Multiplication of many-digital numbers by automatic computers, In USSR Academy of Sciences, vol.145, pp.293-294, 1962. ,
Parametricity in an Impredicative Sort, CSL Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.381-395, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00730913
Automatic Data Refinement, Interactive Theorem Proving, pp.84-99, 2013. ,
DOI : 10.1007/978-3-642-39634-2_9
Computation and reasoning: a type theory for computer science, 1994. ,
Changing Data Representation within the Coq System, TPHOLs, pp.87-102, 2003. ,
DOI : 10.1007/10930755_6
The view from the left, Journal of Functional Programming, vol.14, issue.1, pp.69-111, 2004. ,
DOI : 10.1017/S0956796803004829
Homotopy Type Theory: Univalent Foundations of Mathematics. Institute for Advanced Study, 2013. ,
Types, abstraction and parametric polymorphism, IFIP Congress, pp.513-523, 1983. ,
Sets in homotopy type theory, 2013. Preprint ,
Efficient Gaussian Elimination Method for Symbolic Determinants and Linear Systems, ACM Transactions on Mathematical Software, vol.8, issue.3, pp.277-289, 1982. ,
DOI : 10.1145/356004.356007
A new look at generalized rewriting in type theory, Journal of Formalized Reasoning, vol.2, issue.1, pp.41-62, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00628904
First-Class Type Classes, TPHOLs, pp.278-293, 2008. ,
DOI : 10.1007/11542384_8
URL : https://hal.archives-ouvertes.fr/inria-00628864
Type Classes for Mathematics in Type Theory . MSCS, special issue on 'Interactive theorem proving and the formalization of mathematics, pp.1-31, 2011. ,
Gaussian elimination is not optimal, Numerische Mathematik, vol.13, issue.4, pp.354-356, 1969. ,
DOI : 10.1007/BF02165411
Views: a way for pattern matching to cohabit with data abstraction, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '87, pp.307-313, 1987. ,
DOI : 10.1145/41625.41653
Theorems for free! In Functional Programming Languages and Computer Architecture, pp.347-359, 1989. ,