Matthieu Sozeau

980 total citations
16 papers, 167 citations indexed

About

Matthieu Sozeau is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Matthieu Sozeau has authored 16 papers receiving a total of 167 indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Artificial Intelligence, 12 papers in Computational Theory and Mathematics and 1 paper in Computer Networks and Communications. Recurrent topics in Matthieu Sozeau's work include Logic, programming, and type systems (16 papers), Formal Methods in Verification (9 papers) and Security and Verification in Computing (7 papers). Matthieu Sozeau is often cited by papers focused on Logic, programming, and type systems (16 papers), Formal Methods in Verification (9 papers) and Security and Verification in Computing (7 papers). Matthieu Sozeau collaborates with scholars based in France, Germany and Chile. Matthieu Sozeau's co-authors include Nicolas Tabareau, Yannick Forster, Éric Tanter, Ana Bove, Alexander Krauß, Abhishek Anand, Gregory Malecha and Cyril Cohen and has published in prestigious journals such as SHILAP Revista de lepidopterología, Journal of the ACM and ACM SIGPLAN Notices.

In The Last Decade

Matthieu Sozeau

14 papers receiving 162 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Matthieu Sozeau France 7 153 116 19 15 13 16 167
Assia Mahboubi France 5 110 0.7× 98 0.8× 22 1.2× 16 1.1× 13 1.0× 14 146
Makarius Wenzel Germany 7 112 0.7× 75 0.6× 24 1.3× 16 1.1× 13 1.0× 16 131
Kevin Millikin Denmark 8 139 0.9× 83 0.7× 13 0.7× 13 0.9× 19 1.5× 15 143
Stefan Berghofer Germany 7 164 1.1× 120 1.0× 22 1.2× 12 0.8× 10 0.8× 19 181
Robert Dockins United States 6 133 0.9× 92 0.8× 34 1.8× 31 2.1× 10 0.8× 11 144
Vasileios Koutavas Ireland 6 126 0.8× 79 0.7× 36 1.9× 14 0.9× 15 1.2× 14 137
Temur Kutsia Austria 7 175 1.1× 105 0.9× 47 2.5× 10 0.7× 19 1.5× 53 205
Ben Moszkowski United Kingdom 7 139 0.9× 120 1.0× 33 1.7× 17 1.1× 17 1.3× 24 167
Brian Aydemir United States 4 184 1.2× 104 0.9× 28 1.5× 18 1.2× 28 2.2× 6 187
Naoki Nishida Japan 7 106 0.7× 78 0.7× 19 1.0× 18 1.2× 10 0.8× 35 121

Countries citing papers authored by Matthieu Sozeau

Since Specialization
Citations

This map shows the geographic impact of Matthieu Sozeau's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Matthieu Sozeau with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Matthieu Sozeau more than expected).

Fields of papers citing papers by Matthieu Sozeau

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Matthieu Sozeau. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Matthieu Sozeau. The network helps show where Matthieu Sozeau may publish in the future.

Co-authorship network of co-authors of Matthieu Sozeau

This figure shows the co-authorship network connecting the top 25 collaborators of Matthieu Sozeau. A scholar is included among the top collaborators of Matthieu Sozeau based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Matthieu Sozeau. Matthieu Sozeau is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

16 of 16 papers shown
1.
Sozeau, Matthieu, et al.. (2025). All Your Base Are Belong to Us: Sort Polymorphism for Proof Assistants. Proceedings of the ACM on Programming Languages. 9(POPL). 2253–2281.
2.
Forster, Yannick, Matthieu Sozeau, & Nicolas Tabareau. (2024). Verified Extraction from Coq to OCaml. Proceedings of the ACM on Programming Languages. 8(PLDI). 52–75. 3 indexed citations
3.
Sozeau, Matthieu, et al.. (2024). Correct and Complete Type Checking and Certified Erasure for Coq , in Coq. Journal of the ACM. 72(1). 1–74.
4.
Sozeau, Matthieu, Abhishek Anand, Cyril Cohen, et al.. (2020). The MetaCoq Project. Journal of Automated Reasoning. 64(5). 947–999. 21 indexed citations
5.
Sozeau, Matthieu, et al.. (2019). Definitional proof-irrelevance without K. Proceedings of the ACM on Programming Languages. 3(POPL). 1–28. 19 indexed citations
6.
Sozeau, Matthieu, et al.. (2019). Coq Coq correct! verification of type checking and erasure for Coq, in Coq. Proceedings of the ACM on Programming Languages. 4(POPL). 1–28. 26 indexed citations
7.
Sozeau, Matthieu, et al.. (2019). Equations reloaded: high-level dependently-typed functional programming and proving in Coq. Proceedings of the ACM on Programming Languages. 3(ICFP). 1–29. 22 indexed citations
8.
Tabareau, Nicolas, Éric Tanter, & Matthieu Sozeau. (2018). Equivalences for free: univalent parametricity for effective transport. Proceedings of the ACM on Programming Languages. 2(ICFP). 1–29. 8 indexed citations
9.
Sozeau, Matthieu, et al.. (2017). A comprehensible guide to a new unifier for CIC including universe polymorphism and overloading. Journal of Functional Programming. 27. 3 indexed citations
10.
Sozeau, Matthieu, et al.. (2016). The Definitional Side of the Forcing. 367–376. 4 indexed citations
11.
Sozeau, Matthieu, et al.. (2015). Equations for Hereditary Substitution in Leivant's Predicative System F: A Case Study. SHILAP Revista de lepidopterología. 185. 71–86. 3 indexed citations
12.
Sozeau, Matthieu, et al.. (2015). A unification algorithm for Coq featuring universe polymorphism and overloading. ACM SIGPLAN Notices. 50(9). 179–191. 1 indexed citations
13.
Bove, Ana, Alexander Krauß, & Matthieu Sozeau. (2014). Partiality and recursion in interactive theorem provers – an overview. Mathematical Structures in Computer Science. 26(1). 38–88. 6 indexed citations
14.
Sozeau, Matthieu. (2009). A New Look at Generalized Rewriting in Type Theory. SHILAP Revista de lepidopterología. 26 indexed citations
15.
Sozeau, Matthieu. (2007). Program-ing finger trees in C oq. HAL (Le Centre pour la Communication Scientifique Directe). 13–24. 21 indexed citations
16.
Sozeau, Matthieu. (2007). Program-ing finger trees in C oq. ACM SIGPLAN Notices. 42(9). 13–24. 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026