Nominal Matching and Alpha - Equivalence ? ( Extended

Nominal techniques were introduced to represent in a simple and natural way systems that involve binders. The syntax includes an abstraction operator and a primitive notion of name swapping. Nominal matching is matching modulo α-equality, and has applications in programming languages and theorem proving, amongst others. In this paper we describe efficient algorithms to check the validity of equations involving binders, and also to solve matching problems modulo α-equivalence, using the nominal approach.