Blanchette, J.C., Gheri, L., Popescu, A. orcid.org/0000-0001-8747-0619 et al. (1 more author) (2019) Bindings as bounded natural functors. Proceedings of the ACM on Programming Languages, 3 (POPL). 22. ISSN 2475-1421
Abstract
We present a general framework for specifying and reasoning about syntax with bindings. Abstract binder types are modeled using a universe of functors on sets, subject to a number of operations that can be used to construct complex binding patterns and binding-aware datatypes, including non-well-founded and infinitely branching types, in a modular fashion. Despite not committing to any syntactic format, the framework is ``concrete'' enough to provide definitions of the fundamental operators on terms (free variables, alpha-equivalence, and capture-avoiding substitution) and reasoning and definition principles. This work is compatible with classical higher-order logic and has been formalized in the proof assistant Isabelle/HOL.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2019 Copyright held by the owner/author(s). This work is licensed under a Creative Commons Attribution 4.0 International License. (http://creativecommons.org/licenses/by/4.0/) |
Keywords: | syntax with bindings; inductive and coinductive datatypes; proof assistants |
Dates: |
|
Institution: | The University of Sheffield |
Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield) |
Depositing User: | Symplectic Sheffield |
Date Deposited: | 29 May 2020 12:37 |
Last Modified: | 29 May 2020 12:37 |
Status: | Published |
Publisher: | Association for Computing Machinery (ACM) |
Refereed: | Yes |
Identification Number: | 10.1145/3290335 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:161205 |