1. Term rewriting and all that;Baader,1998
2. Complexity and implementation of nominal algorithms;Calvès,2010
3. Matching and alpha-equivalence check for nominal terms;Calvès;J. Comput. Syst. Sci.,2010
4. The complexity of equivariant unification;Cheney,2004
5. R. A. Clouston. Closed terms (unpublished notes). Available from http://cs.au.dk/~ranald/closedterms.pdf 2007.