Théo Winterhalter

Postdoc at the MPI for Security and Privacy in Bochum

Myself

I am currently a postdoc at the MPI for Security and Privacy in Bochum, working with Cătălin Hrițcu. Previously, I was a PhD student of Nicolas Tabareau and Matthieu Sozeau within the Inria team Gallinette at LS2N in Nantes. Before, I was a computer science student at ENS Cachan and graduated from the MPRI (Parisian Master in Computer Science).

My research interests mainly lie in Type Theory and Proof Theory.

You can contact me at firstname.lastname@csp.mpg.de.

Experience

Member of the Artifact Evaluation Committee of ICFP18

Internships

On Extensional Type Theory

with Matthieu Sozeau, at IRIF (Paris 7)

April 2017 — July 2017

On ETT and formalisation of Type Theory

with Andrej Bauer at University of Ljubljana

October 2016 — March 2017

On Resizing Rules and ETT

with Nicolas Tabareau at IMT Atlantique

March 2016 — July 2016

On Sized Types

with Andreas Abel at Chalmers / Gothenburg University

March 2015 — July 2015

On covering systems of congruence to defeat side-channel attacks

with Laurent Imbert and Eleonora Guerrini at LIRMM

June 2014 — July 2014

PhD thesis

Formalisation and Meta-Theory of Type Theory

In this thesis, I talk about the meta-theory of type theory and about how to formalise it in a proof assistant.

I first focus on a conservative translation between extensional type theory and either intensional or weak type theory, entirely written in Coq. The first translation consists in a removal of the reflection of equality rule, whereas the second translation produces something stronger: weak type theory is a type theory with no notion of conversion. The conservativity result implies that conversion doesn't increase the logical power of type theories.

Then, I show my work for the MetaCoq project of formalising and specifying Coq within Coq. In particular I worked on writing a type-checker for Coq, in Coq. This type checker is proven sound with respect to the specification and can be extracted to OCaml code and run independently of Coq's kernel type-checker. For this to work we have to rely on the meta-theory of Coq which we develop, in part, in the MetaCoq project. However, because of Gödel's incompleteness theorems, we cannot prove consistency of Coq within Coq, and this means that some properties—mainly strong normalisation—have to be assumed, i.e. taken as axioms.

Defended on 18 Sept 2020

Research articles

The MetaCoq Project

Matthieu Sozeau, Abhishek Anand, Simon Boulier, Cyril Cohen, Yannick Forster, Fabian Kunze, Gregory Malecha, Nicolas Tabareau and Théo Winterhalter (2020)

JAR

Talks

The rules of type theory

Théo Winterhalter, Andrej Bauer, Philipp Haselwarter

Workshop on Syntax and Semantics of Type Theory, Ljubljana (2017)

Projects

MetaCoq

Metaprogramming in Coq (my contributions are mainly focused on soundness of a type checker for Coq itself)

ogaml

Ocaml graphics and multimedia library

docaml

Automatic documentation generation for ocaml