Anupam Das

ENS de Lyon,
46 Allée d'Italie,
69364, France.



Upcoming events

I am a postdoctoral researcher at École Normale Supérieure de Lyon in the PLUME team in the Laboratoire de l'Informatique du Parallelisme. Earlier I was an Inria Postdoctoral Fellow at Laboratoire d'Informatique de l'Ecole Polytechnique and I did my PhD with Alessio Guglielmi and John Power at the University of Bath. I defended my doctoral thesis The complexity of propositional proofs in deep inference in October 2013.

I have recently been awarded a Marie Skłodowska-Curie fellowship for my project Monotonicity in Logic and Complexity, to take place at DIKU, University of Copenhagen. Further details can be found on the project page.

My research focusses on proof theory, the area of mathematical logic concerned with formal proofs. In particular I am interested in the interactions between logic and computational complexity. During my PhD I studied proof complexity in the deep inference methodology, where inference steps may operate within arbitrary contexts. Since then I have become interested in approaches to complexity via weak theories of arithmetic and substructural logics. Aside from this, I also work on various aspects of rewriting theory and the proof theory of logics over relational structures.

I teach regularly in the classroom and laboratory for both mathematics and computer science.

Outside academia I used to be an amateur distance runner. My UK Athletics profile can be found here.