Locally Nameless Sets
Andrew M. Pitts
Abstract
This paper provides a new mathematical foundation for the locally nameless representation of syntax with binders, one informed by nominal techniques. It gives an equational axiomatization of two key locally nameless operations, "variable opening" and "variable closing" and shows that a lot of the locally nameless infrastructure can be defined from that in a syntax-independent way, including crucially a "shift" functor for name binding. That functor operates on a category whose objects we call locally nameless sets . Functors combining shift with sums and products have initial algebras that recover the usual locally nameless representation of syntax with binders in the finitary case. We demonstrate this by uniformly constructing such an initial locally nameless set for each instance of Plotkin's notion of binding signature. We also show by example that the shift functor is useful for locally nameless sets of a semantic rather than a syntactic character. The category of locally nameless sets is proved to be isomorphic to a known topos of finitely supported M-sets, where M is the full transformation monoid on a countably infinite set. A corollary of the proof is that several categories that have been used in the literature to model variable renaming operations on syntax with binders are all equivalent to each other and to the category of locally nameless sets.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get b1055f11-605e-473f-a32f-677ef77be0d9Cited by top-tier papers2
- Nominal Recursors as Epi-RecursorsAndrei PopescuPOPL 2024 · 4 citations
- Contextual Embeddings: Implementing Bound Variables through Instance ResolutionSamantha Frohlich, Jessica Foster, G. A. Kavvos, Meng WangPLDI 2026
Related papers
- A Unified Treatment of the Substitution Tensor for Presheaves, Nominal Sets, Renaming Sets, and so onFabian Lenke, Stefan Milius, Henning UrbatLICS 2026
- Substructural Abstract Syntax with Variable Binding and Single-Variable SubstitutionMarcelo Fiore, Sanjiv RanchodLICS 2025 · 3 citations
- Automata Learning: An Algebraic ApproachHenning Urbat, Lutz SchröderLICS 2020 · 22 citations
- A Nominal Approach to Probabilistic Separation LogicJohn M. Li, Jon Aytac, Philip Johnson-Freyd, Amal Ahmed et al.LICS 2024 · 8 citations
- Formal metatheory of second-order abstract syntaxMarcelo Fiore, Dmitrij SzamozvancevPOPL 2022 · 20 citations
