Tito's presence on the Web

Welcome to my homepage! I am a graduate student in theoretical computer science at the Laboratoire d’informatique de Paris Nord (LIPN), which means first and foremost being a worker of the French public university system. I started my PhD in 2018 under the supervision of Stefano Guerrini and Thomas Seiller.

Actually important stuff

The overriding concern of our age is the ongoing environmental disaster. There is a Pledge for sustainable research in theoretical computer science that you can sign if you work in that field.

I’m glad to see that virtual conferences are taking off (out of necessity), but worried by the widespread use of tools with serious privacy and security issues. As computer scientists, we should hold ourselves to a higher standard so that society at large can follow our example!

Mon laboratoire est opposé au projet de Loi pluriannuelle de programmation de la recherche (LPPR) (de retour après le déconfinement) ainsi qu’à la réforme des retraites.

All my publications until now are open access. I refuse to submit my work to any venue that does not meet this requirement (being allowed to upload a preprint is not sufficient), no matter how prestigious it may be – anyway, publications should be judged on their own merits. (I’ve been pressured to do so before, and was relieved that the paper was rejected.) I also pledge not to provide peer review for closed-access venues.

This rigid stance is made tenable by my commitment to not apply for any kind of permanent academic position in the future, in order to escape the distorted incentives of contemporary research and the countless annoyances that well-meaning people will put you through for the sake of “career optimization”. If you’re a non-tenured researcher intending to stay in academia, following my example may or may not be career suicide (corollary: you should probably not collaborate with me, which is pretty sad, but blame the system).

Contact / personal information

Family name Given name Email address
Nguyễn Lê Thành Dũng nltd at nguyentito dot eu


My research focuses on connections between linear logic, a logical system born out of the proofs-as-programs correspondence (“Curry-Howard isomorphism”), and other topics in theoretical computer science such as graph theory, computational complexity, formal languages (finite automata / transducers / semigroups) …

Outside of my research work, I also have other scientific interests which I lack the time to pursue:

I tend to agree with David Madore when he says that “the only people interested in publication lists look like they to want to count them, not to read them”. Nevertheless, if you’re looking for a specific paper of mine, it should be hyperlinked in the middle of some relevant explanatory paragraph below. (For bean-counting purposes my dblp profile is not too hard to find, though it has a missing tilde on my family name – this spelling issue also occurs on arXiv due to lack of Unicode support.)

The click-to-expand parts in this section use the HTML5 <details> element, no JavaScript involved! (However, Markdown/pandoc adds <p> tags…)

Expository and/or not my own work

A note on arXiv about a simple theorem in discrete geometry / linear algebra. (To be updated with a much simpler proof by Dorian Nogneng.)

Some slides on the expressivity of the simply-typed λ-calculus:

Implicit automata in typed λ-calculi

Implicit computational complexity seeks to characterize complexity classes by using constrained programming languages. Pierre Pradic and I have been recently exploring a counterpart for automata and transducers, relying on subsystems of linear logic.

A “secret ingredient” is the use of Böhm-Berarducci encodings (often called “Church encodings”): they were already known to be closely related to automata, as explained in the expository talks in the previous section (see also: higher-order model checking). An old open question that I’m interested in is: what functions between Church-encoded strings can the simply typed λ-calculus express?

One result that I’m proud of is a characterization of star-free languages using a non-commutative type system. We are currently working on MSO and FO transductions by recasting streaming string transducers in Colcombet and Petrişan’s category-theoretic framework and relating this to the categorical semantics of linear logic.


Denotational semantics of polymorphism vs space complexity

What led me to automata (cf. above) was finding out that regular languages occur in a language with linear types designed for implicit complexity. It turns out that the proof for this relies on old ideas on the denotational semantics of second-order linear logic. Another direction was to understand how to go beyond regular languages using the same ideas.

The result was an implicit characterization of logarithmic space, whose proof uses a bit of semantics and of category theory (in particular normal functors). The implicit complexity side of the story – a joint work with Pierre Pradic – was published. The semantics side is far from being as rigorous as I would like and is being rewritten at the moment (March 2020); in the meantime, you can take a look at this old preprint. Here is a talk targeted at a broad audience, that does not require prior knowledge of linear logic.

Some further material on the semantics of second-order logic in an obsolete preprint (joint work with Paolo Pistone, Thomas Seiller and Lorenzo Tortora de Falco) should be reworked in the near future with an application to transducers. The Chocola talk slides below also contain some ideas that I haven’t pursued further for now.

Talks (for an audience familiar with linear logic and/or denotational semantics)

Talks (for the implicit computational complexity community)

Proof nets through the lens of graph theory

In a pioneering work whose significance has been underestimated in my opinion, Christian Retoré provided a translation from proof nets for linear logic, a graphical representation of proofs, to graphs equipped with perfect matchings. This relates the combinatorially tricky theory of proof nets with a well-studied counterpart in mainstream graph theory. I strengthened and refined the correspondence between the two – the relationship is not bijective, but it turns out there are reductions in both directions preserving many structural properties – and derived a lot of consequences that had been overlooked. See my journal paper extending the work I presented at the FSCD 2018 conference (cf. list of talks).

Recently Lutz Straßburger and I have been looking at Retoré’s pomset logic (and Guglielmi’s closely related system BV, the original deep inference system) using the same tools. We hope to publish something soon-ish.

At the end of these slides I explain why proof net correctness for cyclic MLL (a non-commutative logic) can be decided in linear time, using a criterion by Paul-André Melliès reformulated using combinatorial maps.

Finally, in another arXiv note, I prove some purely graph-theoretic minor results initially motivated by my work on proof nets. In particular, this concerns edge-colored graphs and paths/trails avoiding forbidden transitions.

Talks (for logicians)

Talks (for graph theorists)


Coherent interaction graphs (with Thomas Seiller) A rather specialized and technical paper (slides): we built a variant of Seiller’s interaction graphs model for multiplicative linear logic, in which the correctness criterion for proof nets admits a convincing interpretation as a non-deterministic counter-proof. That is, we revisit an idea from the early days of linear logic (cf. Girard’s Multiplicatives) in a more satisfactory way. Interestingly, we recover a correctness criterion by Retoré using cographs that some recent work (independent from us) has tried to extend this to arbitrary graphs, in order to find generalized notions of multiplicative linear connectives.
Unfruitful work in combinatorial optimization (Master’s internship) In 2016, I did a 4-month internship with Christoph Dürr and Nguyễn Kim Thắng for my master’s degree. We tried to design an approximation algorithm for the online node-weighted Steiner forest problem. Our approach didn’t work, but we improved our understanding of the difficulty of the problem. However, thanks to a recreational algorithmic puzzle given by Christoph during this internship, I learned about the relationship between perfect matchings and edge-colored graphs, which would eventually lead to my above-mentioned work. You can see my first ideas on these topics and their connection to linear logic in the slides of the defense (in French).

Involvement in computer science teaching / outreach

Science popularization

In 2015, Jérémy Ledent and I wrote some articles for Tangente, a French math magazine for high schoolers, on the aforementioned proofs-as-programs correspondence and on homotopy type theory.


As a member of the Prologin organization from 2014 to 2018, I helped organize Prologin, a programming contest for people under 20 years old, and Girls Can Code!, a summer coding camp.

I was in charge of the semifinal problems in 2015 and 2016. Furthermore, in 2015, I was the main developer on the game for which the contestants had to write an AI during the finals; and from mid-2015 to mid-2016, I was heavily involved in the logistics of both Prologin and Girls Can Code! as a board member.

From 2017 to 2018, I designed and implemented programming contest exercises as a freelance consultant for Isograd, selling the skills that I had developed thanks to Prologin to the private sector.

University teaching

In 2016, I was a teaching assistant for the Algorithms course given by Gaël Mahé at Université Paris Descartes for second-year students.

Since 2018, I have been TAing as part of my PhD at Institut Galilée, Université Paris 13.