We have developed and mechanically verified an ML system called CakeML, which
supports a substantial subset of Standard ML. CakeML is implemented as an interactive …

Static and dynamic type systems have well-known strengths and weaknesses. In previous
work we developed a gradual type system for a functional calculus named λ^?_→. Gradual …

Abstract Development of formal proofs of correctness of programs can increase actual and
perceived reliability and facilitate better understanding of program specifications and their …

We present parametric higher-order abstract syntax (PHOAS), a new approach to
formalizing the syntax of programming languages in computer proof assistants based on …

Machine-checked proofs of properties of programming languages have become acritical
need, both for increased confidence in large and complex designsand as a foundation for …

This paper provides an introduction to the locally nameless approach to the representation
of syntax with variable binding, focusing in particular on the use of this technique in formal …

Semantic definitions of full-scale programming languages are rarely given, despite the many
potential benefits. Partly this is because the available metalanguages for expressing …

This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover
using nominal techniques. Central to the formalisation is an inductive set that is bijective with …

We present an extensive mechanization of the metatheory of Martin-Löf Type Theory (MLTT)
in the Coq proof assistant. Our development builds on pre-existing work in Agda to show not …

Live programming environments aim to provide programmers (and sometimes audiences)
with continuous feedback about a program's dynamic behavior as it is being edited. The …