Nominal sets provide a promising new mathematical analysis of names in formal languages
based upon symmetry, with many applications to the syntax and semantics of programming …

We present a generalisation of first-order unification to the practically important case of
equations between terms involving binding operations. A substitution of terms for variables …

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 …

Cαml is a tool that turns a so-called “binding specification” into an Objective Caml
compilation unit. A binding specification resembles an algebraic data type declaration, but …

Nominal rewriting is based on the observation that if we add support for α-equivalence to
first-order syntax using the nominal-set approach, then systems with binding, including …

FreshML extends ML with elegant and practical constructs for declaring and manipulating
syntactical data involving statically scoped binding operations. User-declared FreshML …

We present ReactiveML, a programming language dedicated to the implementation of
complex reactive systems as found in graphical user interfaces, video games or simulation …

In this paper we define an inductive set that is bijective with the α-equated lambda-terms.
Unlike de-Bruijn indices, however, our inductive definition includes names and reasoning …

The promise of logic programming is that programs can be written relationally, without
distinguishing between input and output arguments. Relational programs are remarkably …

There are two well-known approaches to programming with names, binding, and
equivalence up to consistent renaming: representing names and bindings as concrete …