Gradual type systems offer a smooth continuum between static and dynamic typing by
permitting the free mixture of typed and untyped code. The runtime systems for these …

Traditional static type systems are effective for verifying basic interface specifications.
Dynamically checked contracts support more precise specifications, but these are not …

Since Findler and Felleisen introduced higher-order contracts, many variants have been
proposed. Broadly, these fall into two groups: some follow Findler and Felleisen in using …

We present Low-Level Liquid Types, a refinement type system for C based on Liquid Types.
Low-Level Liquid Types combine refinement types with three key elements to automate …

Motivated by recent research in abstract model checking, we present a new approach to
inferring dependent types. Unlike many of the existing approaches, our approach does not …

The definition of type equivalence is one of the most important design issues for any typed
language. In dependently typed languages, because terms appear in types, this definition …

Refinement Types are a promising approach for checking behavioral properties of programs
written using advanced language features like higher-order functions, parametric …