The Rust programming language provides a powerful type system that checks linearity and
borrowing, allowing code to safely manipulate memory without garbage collection and …

We describe a sound method for automatically proving Hoare triples for loop-free code in
Separation Logic, for certain preconditions and postconditions (symbolic heaps). The …

We consider the problem of reconciling a dependently typed functional language with
imperative features such as mutable higher-order state, pointer aliasing, and …

Moggi's Computational Monads and Power et al.'s equivalent notion of Freyd category have
captured a large range of computational effects present in programming languages …

Rust claims to advance industrial programming by bridging the gap between low-level
systems programming and high-level application programming. At the heart of the argument …

Substructural type systems are growing in popularity because they allow for a resourceful
interpretation of data which can be used to rule out various software bugs. Indeed …

We present a simple algorithm for register allocation which is competitive with the iterated
register coalescing algorithm of George and Appel. We base our algorithm on the …

We propose a new collection of benchmark problems in mechanizing the metatheory of
programming languages, in order to compare and push the state of the art of proof …

The type-and-effects system of the Tofte-Talpin region calculus makes it possible to safely
reclaim objects without a garbage collector. However, it requires that regions have last-in …

Recently we have seen a renewed interest in programming languages that tame the
complexity of state and concurrency through refined type systems with more fine-grained …