Jérémy Ledent
About me
I am currently doing a PhD in computer science at École Polytechnique, supervised by Samuel Mimram and Éric Goubault.
I study geometric semantics of concurrent programs, and links to the computability of concurrent tasks.
Previously, I was a student at ÉNS Lyon.
Research interests
- Concurrency
- Geometry, (algebraic) topology
- Category theory
- Semantics of programming languages
- Logic, λ-calculus, type theory
- Formal languages and automata
Publications
- Bried announcement: On the impossibility of detecting concurrency, Éric Goubault, Jérémy Ledent, Samuel Mimram (DISC 2018)
[paper] [slides]
- A Simplicial Complex Model for Dynamic Epistemic Logic to study Distributed Task Computability, Éric Goubault, Jérémy Ledent, Sergio Rajsbaum (GandALF 2018)
[paper] [slides]
- A cartesian closed category for higher-order model checking, Martin Hofmann, Jérémy Ledent (LICS 2017)
[paper] [slides]
Internships
- 2016: internship at Ludwig-Maximilians University (LMU), Munich, supervised by Martin Hofmann.
- M2 (2015): Sub-extensional type theory at Université Paris 7, supervised by Hugo Herbelin.
[report] [slides (fr)]
- M1 (2014): Modeling set theory in homotopy type theory at Radboud University, Nijmegen, surpervised by Bas Spitters and Freek Wiedijk.
[blog post]
[report] [slides (fr)]
- L3 (2013): Streaming string transducers at LaBRI, Bordeaux, supervised by Anca Muscholl and Sylvain Salvati.
[report] [slides (fr)]
Teaching
- 2017: Practical sessions at École Polytechnique:
- Introduction à l'informatique (INF311).
- Concurrence (INF431).
- 2016: Computer-Aided Formal Reasoning (LMU Munich)
Other stuff
Contact
(λxy. x.y@lix.polytechnique.fr) jeremy ledent