In the last ten years the study of meta-programming systems, as formal systems worthy of
study in their own right, has vastly accelerated. In that time a lot has been accomplished, yet …

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 …

The permutation model of set theory with atoms (FM-sets), devised by Fraenkel and
Mostowski in the 1930s, supports notions of 'name-abstraction'and 'fresh name'that provide …

This paper formalises within first-order logic some common practices in computer science to
do with representing and reasoning about syntactical structures involving lexically scoped …

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 …

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 …

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 …

This paper formalises within first-order logic some common practices in computer science to
do with representing and reasoning about syntactical structures involving named bound …

The nominal approach to abstract syntax deals with the issues of bound names and α-
equivalence by considering constructions and properties that are invariant with respect to …