Nominal Unification Revisited

@inproceedings{Urban2010NominalUR,
  title={Nominal Unification Revisited},
  author={Christian Urban},
  booktitle={UNIF},
  year={2010}
}
Nominal unification calculates substitutions that make terms involving binders equal modulo alphaequivalence. 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 alphaequivalence 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… CONTINUE READING

From This Paper

Topics from this paper.
5 Citations
19 References
Similar Papers

Similar Papers

Loading similar papers…