Complexity and Implementation of Nominal Algorithms King's College of London, 2010. ,
The First-Order Nominal Link, Lecture Notes in Computer Science, vol.323, issue.1, pp.234-248, 2010. ,
DOI : 10.1016/j.tcs.2004.06.016
Matching and alpha-equivalence check for nominal terms, Journal of Computer and System Sciences, vol.76, issue.5, pp.283-301, 2010. ,
DOI : 10.1016/j.jcss.2009.10.003
Relating nominal and higher-order pattern unification, Proceedings of the 19th International Workshop on Unification (UNIF 2005), pp.104-119, 2005. ,
Equivariant Unification, Journal of Automated Reasoning, vol.323, issue.1???3, pp.267-300, 2010. ,
DOI : 10.1007/s10817-009-9164-3
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.2544
Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques, Logic Journal of IGPL, vol.18, issue.6, pp.769-822, 2010. ,
DOI : 10.1093/jigpal/jzq006
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.185.3105
A new approach to abstract syntax with variable binding. Formal Asp, Comput, vol.13, issue.3-5, pp.341-363, 2002. ,
The Implementation of Functional Programming Languages, 1987. ,
Nominal Unification from a Higher-Order Perspective, Lecture Notes in Computer Science, vol.5117, pp.246-260, 2008. ,
DOI : 10.1007/978-3-540-70590-1_17
An efficient nominal unification algorithm, Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.209-226, 2010. ,
Nominal logic, a first order theory of names and binding, Information and Computation, vol.186, issue.2, pp.165-193, 2003. ,
DOI : 10.1016/S0890-5401(03)00138-X
Linear unification of higher-order patterns, Lecture Notes in Computer Science, vol.668, pp.391-405, 1993. ,
DOI : 10.1007/3-540-56610-4_78
Nominal unification, Theoretical Computer Science, vol.323, issue.1-3, pp.473-497, 2004. ,
DOI : 10.1016/j.tcs.2004.06.016