Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques

Logic Journal of the IGPL 18 (6):769-822 (2010)
  Copy   BIBTEX

Abstract

Nominal terms extend first-order terms with binding. They lack some properties of first- and higher-order terms: Terms must be reasoned about in a context of ‘freshness assumptions’; it is not always possible to ‘choose a fresh variable symbol’ for a nominal term; it is not always possible to ‘α-convert a bound variable symbol’ or to ‘quotient by α-equivalence’; the notion of unifier is not based just on substitution.Permissive nominal terms closely resemble nominal terms but they recover these properties, and in particular the ‘always fresh’ and ‘always rename’ properties. In the permissive world, freshness contexts are elided, equality is fixed, and the notion of unifier is based on substitution alone rather than on nominal terms’ notion of unification based on substitution plus extra freshness conditions.We prove that expressivity is not lost moving to the permissive case and provide an injection of nominal terms unification problems and their solutions into permissive nominal terms problems and their solutions.We investigate the relation between permissive nominal unification and higher-order pattern unification. We show how to translate permissive nominal unification problems and solutions in a sound, complete, and optimal manner, in suitable senses which we make formal.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,642

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2016-06-30

Downloads
1 (#1,722,932)

6 months
17 (#859,272)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Completeness and Herbrand Theorems for Nominal Logic.James Cheney - 2006 - Journal of Symbolic Logic 71 (1):299 - 320.

Add more references