Research activities
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.
I am the current director of my research laboratory.
|
|
Research groups and projects I am involved in:
|
Ph.D. students:
In the past, I advised or co-advised the following Ph.D. students, who have now defended their thesis:
- Boris Eng: An exegesis of transcendental syntax, defended in June 2023. Advised by Thomas Seiller (I was the formal advisor).
- Luc Pellissier: Réductions et Approximations Linéaires, defended in December 2017. Formal advisor: Stefano Guerrini.
- Pierre Vial: Non-idempotent Typing Operators: Beyond the Lambda-Calculus, defended in December 2017. Advisor: Delia Kesner (PPS, Paris 7).
- Aloïs Brunel: The Monitoring Power of Forcing Transformations, defended in June 2014. Formal advisor: Stefano Guerrini.
- Andrei Dorman: Concurrency in Interaction Nets and Graph Rewriting, defended in June 2013. Formal advisor: Lorenzo Tortora de Falco (joint Ph.D. thesis with Università Roma Tre, formally co-advised at Paris 13 by Stefano Guerrini).
In France, only a person having obtained the habilitation degree may advise PhD students. People without habilitation usually co-advise students. If they fully advise them, then a "formal advisor" is required. This is what the expression "formal advisor" above refers to.