Logic, semantics of programming languages, type systems, formal methods.

-- Victor Sannier (since september 2023)

-- Alexis Ghyselen (defended 20/9/2021), Sized Types Methods and their Applications to Complexity Analysis in Pi-Calculus. ENS Lyon

— Erika De Benedetti (defended 10/2/2015) (jointly advised with S. Ronchi Della Rocca), Univ. di Torino/ENS de Lyon. “Linear logic, type assignment systems and implicit computational complexity”.
— Matthieu Perrinel (defended 2/7/2015). ENS Lyon. “Investigating the expressivity of linear logic subsystems characterizing polynomial time”.
— Antoine Madet (defended 6/12/2012) (jointly advised with R. Amadio), Univ. Paris 7. “Complexité Implicite de Lambda-Calculs Concurrents”.
— Marc Lasson (defended 20/11/2012) (jointly advised with O. Laurent), ENS de Lyon. “Réalisabilité et Paramétricité dans les Systèmes de Types Purs”.
— Vincent Atassi (soutenue 2/12/2008) (jointly advised with J. Vauzeilles), Univ. Paris 13. “Typing and Optimal reduction for lambda calculus in variants of Linear logic for Implicit computational complexity”.
— Daniel de Carvalho (defended 4/9/2007) (jointly advised with T. Ehrhard), Univ. Aix-Marseille II. “Sémantiques de la logique linéaire et temps de calcul”.

-- Leandro Gomes, since 6/2022

-- Former postdocs: Anupam Das (10/2015-10/2016), Paolo Tranquilli (2009-2010), Damiano Mazza (2006-2007), Ugo Dal Lago (2006), Jean-Yves Moyen (2005-2006).