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 …

Permissive-Nominal Logic (PNL) is an extension of first-order logic where term-formers can
bind names in their arguments. This allows for direct axiomatisations with binders, such as …

Nominal sets are a sets-based first-order denotation for variables in logic and programming.
In this paper we extend nominal sets to two-level nominal sets. These preserve much of the …

Permissive-Nominal Logic (PNL) is an extension of first-order predicate logic in which term-
formers can bind names in their arguments. This allows for direct axiomatisations with …

We consider the theories of nominal unification and rewriting for a new and simplified
presentation of nominal terms, based on modelling moderated nominal unknowns as infinite …

Permissive-Nominal Logic (PNL) is an extension of first-order predicate logic in which term-
formers can bind names in their arguments. This allows for direct axiomatizations with …

The Curry-Howard correspondence connects derivations in natural deduction with the
lambda-calculus. Predicates are types, derivations are terms. This supports reasoning from …

Nominal terms are a meta-language for manipulating syntax with binding. What if we give
this syntax extra properties—such as being executable? We obtain a functional …