Tree-structured neural networks exploit valuable syntactic parse information as they interpret
the meanings of sentences. However, they suffer from two key technical problems that make …

Many components of a dependently typed programming language are by now well
understood, for example, the underlying type theory, type checking, unification and …

This article describes the development and formal verification (proof of semantic
preservation) of a compiler back-end from Cminor (a simple imperative intermediate …

Haskell is a purely functional language that allows programmers to rapidly develop clear,
concise, and correct software. The language has grown in popularity in recent years, both in …

Grammatical Framework (GF) is a special-purpose functional language for defining
grammars. It uses a Logical Framework (LF) for a description of abstract syntax, and adds to …

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 …

Research in dependent type theories [ML71a] has, in the past, concentrated on its use in the
presentation of theorems and theorem-proving. This thesis is concerned mainly with the …

We introduce the notion of containers as a mathematical formalisation of the idea that many
important datatypes consist of templates where data is stored. We show that containers have …

This report gives an account of a successful formalization of the proof of the Four Colour
Theorem, which was fully checked by the Coq v7. 3.1 proof assistant [13]. This proof is …

The C programming language was created by Thompson and Ritchie around 1970 as the
implementation language of the Unix operating system [Rit93]. The development of Unix …