| First-class type classes M Sozeau, N Oury International Conference on Theorem Proving in Higher Order Logics, 278-293, 2008 | 323 | 2008 |
| CertiCoq: A verified compiler for Coq A Anand, A Appel, G Morrisett, Z Paraskevopoulou, R Pollack, ... The third international workshop on Coq for programming languages (CoqPL), 2017 | 146 | 2017 |
| Subset Coercions in Coq M Sozeau International Workshop on Types for Proofs and Programs, 237-252, 2006 | 134 | 2006 |
| The metacoq project M Sozeau, A Anand, S Boulier, C Cohen, Y Forster, F Kunze, G Malecha, ... Journal of automated reasoning 64 (5), 947-999, 2020 | 130 | 2020 |
| Coq coq correct! verification of type checking and erasure for coq, in coq M Sozeau, S Boulier, Y Forster, N Tabareau, T Winterhalter Proceedings of the ACM on Programming Languages 4 (POPL), 1-28, 2019 | 120 | 2019 |
| The HoTT library: a formalization of homotopy type theory in Coq A Bauer, J Gross, PLF Lumsdaine, M Shulman, M Sozeau, B Spitters Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and …, 2017 | 110 | 2017 |
| A new look at generalized rewriting in type theory M Sozeau Journal of formalized reasoning 2 (1), 41-62, 2009 | 109 | 2009 |
| Universe Polymorphism in Coq M Sozeau, N Tabareau International Conference on Interactive Theorem Proving, 499-514, 2014 | 88 | 2014 |
| Definitional proof-irrelevance without K G Gilbert, J Cockx, M Sozeau, N Tabareau Proceedings of the ACM on Programming Languages 3 (POPL), 1-28, 2019 | 87 | 2019 |
| Equations reloaded: High-level dependently-typed functional programming and proving in Coq M Sozeau, C Mangin Proceedings of the ACM on Programming Languages 3 (ICFP), 1-29, 2019 | 76 | 2019 |
| Towards Certified Meta-Programming with Typed Template-Coq A Anand, S Boulier, C Cohen, M Sozeau, N Tabareau International Conference on Interactive Theorem Proving, 20-39, 2018 | 74 | 2018 |
| Equations: A dependent pattern-matching compiler M Sozeau International Conference on Interactive Theorem Proving, 419-434, 2010 | 70 | 2010 |
| Program-ing finger trees in Coq M Sozeau Proceedings of the 12th ACM SIGPLAN international conference on Functional …, 2007 | 66 | 2007 |
| Extending type theory with forcing G Jaber, N Tabareau, M Sozeau 2012 27th Annual IEEE Symposium on Logic in Computer Science, 395-404, 2012 | 51 | 2012 |
| Equivalences for free: univalent parametricity for effective transport N Tabareau, É Tanter, M Sozeau Proceedings of the ACM on Programming Languages 2 (ICFP), 1-29, 2018 | 47 | 2018 |
| Eliminating reflection from type theory T Winterhalter, M Sozeau, N Tabareau Proceedings of the 8th ACM SIGPLAN International Conference on Certified …, 2019 | 41 | 2019 |
| The definitional side of the forcing G Jaber, G Lewertowski, PM Pédrot, M Sozeau, N Tabareau Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016 | 39 | 2016 |
| Partiality and recursion in interactive theorem provers–an overview A Bove, A Krauss, M Sozeau Mathematical Structures in Computer Science 26 (1), 38-88, 2016 | 36 | 2016 |
| The marriage of univalence and parametricity N Tabareau, É Tanter, M Sozeau Journal of the ACM (JACM) 68 (1), 1-44, 2021 | 33 | 2021 |
| A unification algorithm for Coq featuring universe polymorphism and overloading B Ziliani, M Sozeau Proceedings of the 20th ACM SIGPLAN International Conference on Functional …, 2015 | 32 | 2015 |
nicolas tabareauInriaEmail được xác minh tại inria.fr