Nominal Unification Revisited
Logic in Computer Science
2010-12-23 v1 Programming Languages
Abstract
Nominal unification calculates substitutions that make terms involving binders equal modulo alpha-equivalence. Although nominal unification can be seen as equivalent to Miller's higher-order pattern unification, it has properties, such as the use of first-order terms with names (as opposed to alpha-equivalence classes) and that no new names need to be generated during unification, which set it clearly apart from higher-order pattern unification. The purpose of this paper is to simplify a clunky proof from the original paper on nominal unification and to give an overview over some results about nominal unification.
Cite
@article{arxiv.1012.4890,
title = {Nominal Unification Revisited},
author = {Christian Urban},
journal= {arXiv preprint arXiv:1012.4890},
year = {2010}
}
Comments
In Proceedings UNIF 2010, arXiv:1012.4554