Laboratoire d'informatique de l'École polytechnique

Partout Seminar: Nguyễn Lê Thành Dũng (LIPN), "Implicit automata in typed lambda-calculi"

Location: BigBlueButton
Date: Mon, 4 May 2020, 14:00-15:00

We show that various classes of languages and functions from automata theory can be equivalently defined using λ-calculi with substructural types. For instance, we characterize regular string-to-string functions with affine types, and star-free languages with non-commutative types. These results have few direct precedents, but they are analogous to the field of implicit computational complexity, except with automata instead of complexity classes. Our starting point is the little-known fact that the predicates definable over Church-encoded strings in the simply typed λ-calculus are exactly the regular languages (Hillebrand & Kanellakis, LICS’96). More recently, similar ideas have played a prominent role in higher-order model checking.

This is joint work with Pierre Pradic (University of Oxford).

The seminar will take place online. More information is available at: