My field of study is logic in computer science
. More specifically, my research is situated at the interface between logic and computer science provided by the Curry-Howard correspondence
, with an emphasis on the point of view offered by linear logic
and category theory
. Some keywords:
- implicit computational complexity and, more generally, the application of logical methods to structural complexity theory.
the semantics of programming languages and proof systems, in particular lambda-calculi, type systems, proof nets, interaction nets, differential interaction nets, geometry of interaction, etc., with a specific focus on quantitative properties of programs;
concurrent process calculi and their relationship with non-deterministic variants of interaction nets and linear logic proof nets.
Since January 2018, I am the head of the Types, models and programming theory
group within the LoVe
team at LIPN.
I co-supervised the following Ph.D. students, who have now defended their thesis: