Gradually typed languages are designed to support both dynamically typed and statically
typed programming styles while preserving the benefits of each. While existing gradual type …

Prior work on multi-language program verification has achieved impressive results,
including the compositional verification of complex compilers. But the existing approaches to …

Parametric polymorphism and gradual typing have proven to be a difficult combination, with
no language yet produced that satisfies the fundamental theorems of each: parametricity …

Sandboxing is a common technique that allows low-level, untrusted components to safely
interact with trusted code. However, previous work has only investigated the low-level …

Programs are rarely implemented in a single language, and thus questions of type
soundness should address not only the semantics of a single language, but how it interacts …

We investigate gradual variations on the Calculus of Inductive Construction (CIC) for swifter
prototyping with imprecise types and terms. We observe, with a no-go theorem, a crucial …

In 1995, Launchbury and Peyton Jones extended Haskell with an ST monad that allows the
programmer to use higher-order mutable state. They informally argued that these state …

Interoperability pervades nearly all mainstream language implementations, as most systems
leverage subcomponents written in different languages. And yet, such linking can expose a …

Durant leurs plus de 50 ans d'existence, les assistants à la preuve se sont établis comme
des outils permettant un haut niveau de fiabilité dans de nombreuses applications …

We can tease apart the research on gradual types into twolineages': a pragmatic,
implementation-oriented dynamic-first lineage and a formal, type-theoretic, static-first …