default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthieu Sozeau
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Yannick Forster
, Matthieu Sozeau, Nicolas Tabareau:
Verified Extraction from Coq to OCaml. Proc. ACM Program. Lang. 8(PLDI): 52-75 (2024)- 2021
- [j9]Nicolas Tabareau, Éric Tanter, Matthieu Sozeau:
The Marriage of Univalence and Parametricity. J. ACM 68(1): 5:1-5:44 (2021) - [c15]Eric Finster, Antoine Allioux, Matthieu Sozeau:
Types Are Internal ∞-Groupoids. LICS 2021: 1-13 - [c14]Matthieu Sozeau:
Touring the MetaCoq Project (Invited Paper). LFMTP 2021: 13-29 - [i6]Antoine Allioux, Eric Finster, Matthieu Sozeau:
Types are Internal ∞-Groupoids. CoRR abs/2105.00024 (2021) - [i5]Kenji Maillard, Nicolas Margulies, Matthieu Sozeau, Nicolas Tabareau, Éric Tanter:
The Multiverse: Logical Modularity for Proof Assistants. CoRR abs/2108.10259 (2021) - 2020
- [j8]Matthieu Sozeau, Abhishek Anand, Simon Boulier, Cyril Cohen, Yannick Forster, Fabian Kunze, Gregory Malecha, Nicolas Tabareau, Théo Winterhalter:
The MetaCoq Project. J. Autom. Reason. 64(5): 947-999 (2020) - [j7]Matthieu Sozeau, Simon Boulier, Yannick Forster, Nicolas Tabareau, Théo Winterhalter:
Coq Coq correct! verification of type checking and erasure for Coq, in Coq. Proc. ACM Program. Lang. 4(POPL): 8:1-8:28 (2020)
2010 – 2019
- 2019
- [j6]Matthieu Sozeau, Cyprien Mangin:
Equations reloaded: high-level dependently-typed functional programming and proving in Coq. Proc. ACM Program. Lang. 3(ICFP): 86:1-86:29 (2019) - [j5]Gaëtan Gilbert, Jesper Cockx, Matthieu Sozeau, Nicolas Tabareau:
Definitional proof-irrelevance without K. Proc. ACM Program. Lang. 3(POPL): 3:1-3:28 (2019) - [c13]Théo Winterhalter, Matthieu Sozeau, Nicolas Tabareau:
Eliminating reflection from type theory. CPP 2019: 91-103 - [i4]Nicolas Tabareau, Éric Tanter, Matthieu Sozeau:
The Marriage of Univalence and Parametricity. CoRR abs/1909.05027 (2019) - 2018
- [j4]Nicolas Tabareau, Éric Tanter, Matthieu Sozeau:
Equivalences for free: univalent parametricity for effective transport. Proc. ACM Program. Lang. 2(ICFP): 92:1-92:29 (2018) - [c12]Abhishek Anand, Simon Boulier, Cyril Cohen, Matthieu Sozeau, Nicolas Tabareau:
Towards Certified Meta-Programming with Typed Template-Coq. ITP 2018: 20-39 - [c11]Amin Timany, Matthieu Sozeau:
Cumulative Inductive Types In Coq. FSCD 2018: 29:1-29:16 - 2017
- [j3]Beta Ziliani, Matthieu Sozeau:
A comprehensible guide to a new unifier for CIC including universe polymorphism and overloading. J. Funct. Program. 27: e10 (2017) - [c10]Andrej Bauer, Jason Gross, Peter LeFanu Lumsdaine, Michael Shulman, Matthieu Sozeau, Bas Spitters:
The HoTT library: a formalization of homotopy type theory in Coq. CPP 2017: 164-172 - [i3]Amin Timany, Matthieu Sozeau:
Consistency of the Predicative Calculus of Cumulative Inductive Constructions (pCuIC). CoRR abs/1710.03912 (2017) - 2016
- [j2]Ana Bove, Alexander Krauss, Matthieu Sozeau:
Partiality and recursion in interactive theorem provers - an overview. Math. Struct. Comput. Sci. 26(1): 38-88 (2016) - [c9]Guilhem Jaber, Gabriel Lewertowski, Pierre-Marie Pédrot, Matthieu Sozeau, Nicolas Tabareau:
The Definitional Side of the Forcing. LICS 2016: 367-376 - [i2]Andrej Bauer, Jason Gross, Peter LeFanu Lumsdaine, Michael Shulman, Matthieu Sozeau, Bas Spitters:
The HoTT Library: A formalization of homotopy type theory in Coq. CoRR abs/1610.04591 (2016) - 2015
- [c8]Beta Ziliani, Matthieu Sozeau:
A unification algorithm for Coq featuring universe polymorphism and overloading. ICFP 2015: 179-191 - [e1]Hugo Herbelin, Pierre Letouzey, Matthieu Sozeau:
20th International Conference on Types for Proofs and Programs, TYPES 2014, May 12-15, 2014, Paris, France. LIPIcs 39, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2015, ISBN 978-3-939897-88-0 [contents] - [i1]Cyprien Mangin, Matthieu Sozeau:
Equations for Hereditary Substitution in Leivant's Predicative System F: A Case Study. CoRR abs/1508.00455 (2015) - 2014
- [c7]Matthieu Sozeau, Nicolas Tabareau:
Universe Polymorphism in Coq. ITP 2014: 499-514 - [c6]Beta Ziliani, Matthieu Sozeau:
Towards a better-behaved unification algorithm for Coq. UNIF 2014: 74-87 - 2012
- [c5]Guilhem Jaber, Nicolas Tabareau, Matthieu Sozeau:
Extending Type Theory with Forcing. LICS 2012: 395-404 - 2010
- [c4]Matthieu Sozeau:
Equations: A Dependent Pattern-Matching Compiler. ITP 2010: 419-434
2000 – 2009
- 2009
- [j1]Matthieu Sozeau:
A New Look at Generalized Rewriting in Type Theory. J. Formaliz. Reason. 2(1): 41-62 (2009) - 2008
- [b1]Matthieu Sozeau:
Un environnement pour la programmation avec types dépendants. (An environment for programming with dependent types). University of Paris-Sud, Orsay, France, 2008 - [c3]Matthieu Sozeau, Nicolas Oury:
First-Class Type Classes. TPHOLs 2008: 278-293 - 2007
- [c2]Matthieu Sozeau:
Program-ing finger trees in Coq. ICFP 2007: 13-24 - 2006
- [c1]Matthieu Sozeau:
Subset Coercions in Coq. TYPES 2006: 237-252
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
