When calling a method that requires multiple arguments, programmers must pass the
arguments in the expected order. For statically typed languages, the compiler helps …

In statically-typed programming languages, the compiler ensures that method arguments are
passed in the expected order by checking the type of each argument. However, calls to …

Many languages have support for automatic type inference. But when inference fails, the
reported error messages can be unhelpful, highlighting a code location far from the source …

Static type errors are a common stumbling block for newcomers to typed functional
languages. We present a dynamic approach to explaining type errors by generating …

Algebraic effects and handlers are a mechanism to structure programs with computational
effects in a modular way. They are recently gaining popularity and being adopted in practical …

Statically typed languages verify programs at compile-time. As a result many programming
mistakes are detected at an early stage of development. A programmer does not have to …

Static analysis designers must carefully balance precision and efficiency. In our experience,
many static analysis tools are built around an elegant, core algorithm, but that algorithm is …

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 …

Recovering variable types or other structural information from binaries is useful for reverse
engineering in security, and to facilitate other kinds of analysis on binaries. However such …

We present a multi-lingual type inference system for checking type safety across a foreign
function interface. The goal of our system is to prevent foreign function calls from introducing …