Traditional approaches to compensate for the lack of exceptions in type theories for proof
assistants have severe drawbacks from both a programming and a reasoning perspective …

As quantum computers become real, it is high time we come up with effective techniques
that help programmers write correct quantum programs. Inspired by Hoare Type Theory in …

Many substructural type systems have been proposed for controlling access to shared state
in higher-order languages. Central to these systems is the notion of a* resource*, which may …

This work investigates three notions of program equivalence for a higher-order functional
language with recursion and general algebraic effects, in which programs are written in …

Functional programs typically interact with stateful libraries that hide state behind typed
abstractions. One particularly important class of applications are data structure …

Pure functional languages such as Haskell support programming with impure effects by
exploiting mathematical notions such as monads, applicative functors, and arrows. However …

Relational properties describe multiple runs of one or more programs. They characterize
many useful notions of security, program refinement, and equivalence for programs with …

Type systems that prevent data races are a powerful tool for parallel programming,
eliminating whole classes of bugs that are both hard to find and hard to fix. Unfortunately, it …

We provide a way to ease the verification of programs whose state evolves monotonically.
The main idea is that a property witnessed in a prior state can be soundly recalled in the …

Lazy evaluation is a powerful tool for functional programmers. It enables the concise
expression of on-demand computation and a form of compositionality not available under …