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 …

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 …

Session primitives and types provide a flexible programming style for structured interaction,
and are used to statically check the safe and consistent composition of protocols in …

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

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

The nominal syntax is an extension of the first-order syntax that smoothly represents
languages with variable bindings. Nominal matching is first-order matching modulo alpha …

We enhance the calculus of string diagrams for monoidal categories with hierarchical
features in order to capture closed monoidal (and cartesian closed) structure. Using this new …

Nominal Unification is an extension of first-order unification where terms can contain binders
and unification is performed modulo alpha-equivalence. Here we prove that the existence of …

Nominal logic is an extension of first-order logic which provides a simple foundation for
formalizing and reasoning about abstract syntax modulo consistent renaming of bound …

In informal mathematical discourse (such as the text of a paper on theoretical computer
science), we often reason about equalities involving binding of object-variables. We find …