Welcome to my homepage! I am a researcher in theoretical computer science at École normale supérieure de Lyon, Plume team, on an individual postdoctoral fellowship from LabEx MILyon (supervised by Denis Kuperberg).
New: My applications to permanent academic positions are over for this year, see below for my materials. Also, some events I recently attended:
- Workshop on Automata, Transducers, Logic, Algebras & Semigroups (ATLAS'24)
- Archipel 2024: French meeting about research in the Anthropocene
- Undone Computer Science 2024 (which I helped organize a little bit)
Previous positions and job applications (click-to-expand using <details>
)
- CNRS application (2024): here are my detailed summary of previous work, my research statement and my interview slides, all in French.
- Inria application (2024): "dossier de candidature" (application file, in French) in a single file following a strict template.
- Here’s my (very slightly updated) submitted research project (in French) for the MILyon postdoc fellowship.
- March to August 2022: postdoc on Noam Zeilberger’s LambdaComb grant, at École Polytechnique / Inria Saclay.
- September 2021 to February 2022: research engineer in the SPICY team in IRISA (Rennes, France).
- September 2018 to August 2021: PhD student at Université Paris XIII (which uses the brand “Sorbonne Paris Nord” despite having no connection at all to the historical Sorbonne); see my dissertation. I’m technically a student of a student of (Corrado Böhm|Jean-Yves Girard) but concretely, most of my collaborations during my PhD were with people outside of my lab (mainly Cécilia Pradic).
Contact / personal information¶
E-mail address: | nltd at nguyentito dot eu |
Social media: | Mastodon | CS Theory StackExchange | ORCID |
Visual identification: | photo (taken by Lwenn Bussière-Caraes) |
This site is under construction
I am in the process of migrating my website to a new theme based on Rémy Grünblatt's website (and perhaps abandoning my Hakyll setup for something with less dependencies). Stay tuned for more information.
In the meantime, you can check out my old page about a category theory course I taught at ÉNS Lyon or some recent slides about my research:
- Implicit automata in typed λ-calculi (variant with some different material)
- Algebraic recognition of regular functions
- A complexity gap between pomset logic and system BV, via perfect matchings in digraphs
- Ambiguity/growth of tree automata/transducers made easy via MSO queries
- Simply typed convertibility is TOWER-complete even for safe λ-terms
- Syntactically & semantically regular languages of λ-terms coincide through logical relations
These old slides from 2019 on proof nets also contain some remarks that I have never published anywhere else.