Distributed applications are difficult to program reliably and securely. Dependently typed
functional languages promise to prevent broad classes of errors and vulnerabilities, and to …

Advanced type system features, such as GADTs, type classes and type families, have
proven to be invaluable language extensions for ensuring data invariants and program …

Distributed applications are difficult to program reliably and securely. Dependently typed
functional languages promise to prevent broad classes of errors and vulnerabilities, and to …

We propose session-ocaml, a novel library for session-typed concurrent/distributed
programming in OCaml. Our technique solely relies on parametric polymorphism, which can …

We investigate the phenomenon that" every monad is a linear state monad". We do this by
studying a fully-complete state-passing translation from an impure call-by-value language to …

The Glasgow Haskell Compiler is an optimizing compiler that expresses and manipulates
first-class equality proofs in its intermediate language. We describe a simple, elegant …

In Haskell, there are many data types that would form monads were it not for the presence of
type-class constraints on the operations on that data type. This is a frustrating problem in …

Modular languages support generative type abstraction, ensuring that an abstract type is
distinct from its representation, except inside the implementation where the two are …

The importance of reasoning about and refactoring programs is a central tenet of functional
programming. Yet our compilers and development toolchains only provide rudimentary …

This thesis (Habilitation\a diriger des recherches) presents some of my research
contributions since my Ph. D defense in 2008. I have had the chance to participate in the …