Diagnostic messages generated by compilers and interpreters such as syntax error
messages have been researched for over half of a century. Unfortunately, these messages …

In previous work, we introduced scope graphs as a formalism for describing program
binding structure and performing name resolution in an AST-independent way. In this paper …

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 …

We present Lifty, a domain-specific language for data-centric applications that manipulate
sensitive data. A Lifty programmer annotates the sources of sensitive data with declarative …

The design space for type systems that support impredicative instantiation is extremely
complicated. One needs to strike a balance between expressiveness, simplicity for both the …

Compilers for statically typed functional programming languages are notorious for
generating confusing type error messages. When the compiler detects a type error, it …

We introduce a general way to locate programmer mistakes that are detected by static
analyses. The program analysis is expressed in a general constraint language that is …

Many researchers have explored retrofitting static type systems to dynamic languages. This
raises the question of how to add type annotations to code that was previously untyped. One …

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 …

Program analysis tools apply elegant algorithms—such as static analysis, model checking,
and type inference—on source code to help developers resolve compiler errors, apply …