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 …

It is with great pleasure that we are presenting to the community the second edition of this
extraordinary handbook. It has been over 15 years since the publication of the first edition …

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 …

We present an algebraic theory for a fragment of predicate logic. The fragment has
disjunction, existential quantification and equality. It is not an algebraic theory in the …

We are used to the idea that computers operate on numbers, yet another kind of data is
equally important: the syntax of formal languages, with variables, binding, and alpha …

This paper studies the notion of “freshness” that often occurs in the meta-theory of computer
science languages involving various kinds of names. Nominal Equational Logic is an …

Substitution is fundamental to the theory of logic and computation. Is substitution something
that we define on syntax on a case-by-case basis, or can we turn the idea of substitution into …

Nominal terms extend first-order terms with binding. They lack some properties of first-and
higher-order terms: Terms must be reasoned about in a context of 'freshness assumptions'; it …

Nominal algebra is a logic of equality developed to reason algebraically in the presence of
binding. In previous work, it has been shown how nominal algebra can be used to specify …

We analyse the relationship between nominal algebra and nominal rewriting, giving a new
and concise presentation of equational deduction in nominal theories. With some new …