Nominal Unification Revisited
نویسنده
چکیده
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 proof from the original paper on nominal unification and to give an overview over some results about nominal unification.
منابع مشابه
برآورد شاخصهای حمایتی صنایع کاغذسازی کشور با تأکید بر اجرای سیاست یکسانسازی نرخ ارز
One of the ways to be informed on the extent of activities in various industries is to measure the rate of nominal protection. This paper tries to calculate the nominal and effective protection in order to examine the exchange rate unification impacts on the protection of pulp and paper industries with the aim of performing the exchange rate unification policy. Therefore, nominal protection rat...
متن کاملRelating Nominal and Higher-Order Pattern Unification
Higher-order pattern unification and nominal unification are two approaches to unifying modulo some form of α-equivalence (consistent renaming of bound names). Though the higher-order and nominal approaches superficially dissimilar, there is a natural concretion (or name-application) operation for nominal terms that can be used to simulate the behavior of higher-order patterns. We describe a fo...
متن کاملNominal C-Unification
Nominal unification is an extension of first-order unification that takes into account the α-equivalence relation generated by binding operators, following the nominal approach. We propose a sound and complete procedure for nominal unification with commutative operators, or nominal C-unification for short, which has been formalised in Coq. The procedure transforms nominal C-unification problems...
متن کاملThe Complexity of Equivariant Unification
Nominal logic is a first-order theory of names and binding based on a primitive operation of swapping rather than substitution. Urban, Pitts, and Gabbay have developed a nominal unification algorithm that unifies terms up to nominal equality. However, because of nominal logic’s equivariance principle, atomic formulas can be provably equivalent without being provably equal as terms, so resolutio...
متن کاملNominal Narrowing
Nominal unification is a generalisation of first-order unification that takes α-equivalence into account. In this paper, we study nominal unification in the context of equational theories. We introduce nominal narrowing and design a general nominal E-unification procedure, which is sound and complete for a wide class of equational theories. We give examples of application. 1998 ACM Subject Clas...
متن کامل