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 …

Nominal unification is an extension of first-order unification that takes into account the α-
equivalence relation generated by binding operators, following the nominal approach. We …

This paper describes a formalisation in Coq of nominal syntax extended with associative (A),
commutative (C) and associative-commutative (AC) operators. This formalisation is based …

We propose a new axiomatisation of the alpha-equivalence relation for nominal terms,
based on a primitive notion of fixed-point constraint. We show that the standard freshness …

This work extends a rule-based specification of nominal C-unification formalised in Coq to
include 'protected variables' that cannot be instantiated during the unification process. By …

The nominal approach allows us to extend first-order syntax and represent smoothly
systems with variable bindings, using nominal atoms instead of variables and dealing with …

This paper proposes an extension of first-order disunification problems by taking into
account binding operators according to the nominal approach. In this approach, bindings …

The nominal syntax has been used in many application contexts for almost two decades. It is
a powerful tool for dealing with variable binding in a concrete manner that can be applied to …

Many formal languages include binders as well as operators that satisfy equational axioms,
such as commutativity. Here we consider the nominal language, a general formal framework …

Nominal algebra includes α-equality and freshness constraints on nominal terms endowed
with a nominal set semantics that facilitates reasoning about languages with binders …