Locally Nameless Sets

Author:

Pitts Andrew M.1ORCID

Affiliation:

1. University of Cambridge, UK

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Safety, Risk, Reliability and Quality,Software

Reference38 articles.

1. Free Algebras and Automata Realizations in the Language of Categories;Adámek Jiří;Commentationes Mathematicae Universitatis Carolinae,1974

2. 2023. The Agda Wiki. https://wiki.portal.chalmers.se/agda/Main/HomePage 2023. The Agda Wiki. https://wiki.portal.chalmers.se/agda/Main/HomePage

3. Brian Aydemir , Arthur Charguéraud , Benjamin C. Pierce , Randy Pollack , and Stephanie Weirich . 2008 . Engineering Formal Metatheory . In Proceedings of the 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL ’08) . Association for Computing Machinery, New York, NY, USA. 3–15. https://doi.org/10.1145/1328438.1328443 10.1145/1328438.1328443 10.1145/1328438.1328443 Brian Aydemir, Arthur Charguéraud, Benjamin C. Pierce, Randy Pollack, and Stephanie Weirich. 2008. Engineering Formal Metatheory. In Proceedings of the 35th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL ’08). Association for Computing Machinery, New York, NY, USA. 3–15. https://doi.org/10.1145/1328438.1328443 10.1145/1328438.1328443

4. Henk P. Barendregt. 1984. The Lambda Calculus: Its Syntax and Semantics (revised ed.). North-Holland. Henk P. Barendregt. 1984. The Lambda Calculus: Its Syntax and Semantics (revised ed.). North-Holland.

5. Ulrich Berger and Helmut Schwichtenberg . 1991 . An Inverse of the Evaluation Functional for Typed λ -Calculus . In 6th Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, 203–211 . https://doi.org/10.1109/LICS.1991.151645 10.1109/LICS.1991.151645 10.1109/LICS.1991.151645 Ulrich Berger and Helmut Schwichtenberg. 1991. An Inverse of the Evaluation Functional for Typed λ -Calculus. In 6th Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, 203–211. https://doi.org/10.1109/LICS.1991.151645 10.1109/LICS.1991.151645

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Variable binding and substitution for (nameless) dummies;Logical Methods in Computer Science;2024-03-01

2. Nominal Recursors as Epi-Recursors;Proceedings of the ACM on Programming Languages;2024-01-05

3. Rensets and Renaming-Based Recursion for Syntax with Bindings Extended Version;Journal of Automated Reasoning;2023-07-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3