Structure editors allow programmers to edit the tree structure of a program directly. This can
have cognitive benefits, particularly for novice and end-user programmers. It also simplifies …

We present a closed dependent type theory whose inductive types are given not by a
scheme for generative declarations, but by encoding in a universe. Each inductive datatype …

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 …

Programming with dependent types is a blessing and a curse. It is a blessing to be able to
bake invariants into the definition of datatypes: we can finally write correct-by-construction …

We show how to combine a general purpose type system for an existing language with
support for programming with binders and contexts by refining the type system of ML with a …

Recent work on higher-dimensional type theory has explored connections between Martin-
Löf type theory, higher-dimensional category theory, and homotopy theory. These …

The logical framework LF provides an elegant foundation for specifying formal systems and
proofs and it is used successfully in a wide range of applications such as certifying code and …

Several recent security-typed programming languages, such as Aura, PCML5, and Fine,
allow programmers to express and enforce access control and information flow policies. In …

Passive documents and active programs now widely comingle. Document languages
include Turing-complete programming elements, and programming languages include …

We present a general framework for specifying and reasoning about syntax with bindings.
Abstract binder types are modeled using a universe of functors on sets, subject to a number …