van Brügge, J., McKinna, J., Popescu, A. orcid.org/0000-0001-8747-0619 et al. (1 more author) (2025) Barendregt convenes with Knaster and Tarski: strong rule induction for syntax with bindings. In: Hicks, M., (ed.) Proceedings of the ACM on Programming Languages. ACM SIGPLAN Symposium on Principles of Programming Languages (POPL), 14-20 Jan 2024, London, United Kingdom. Association for Computing Machinery (ACM) , pp. 1687-1718.
Abstract
This paper is a contribution to the meta-theory of systems featuring syntax with bindings, such as λ-calculi and logics. It provides a general criterion that targets inductively defined rule-based systems, enabling for them inductive proofs that leverage Barendregt's variable convention of keeping the bound and free variables disjoint. It improves on the state of the art by (1) achieving high generality in the style of Knaster–Tarski fixed point definitions (as opposed to imposing syntactic formats), (2) capturing systems of interest without modifications, and (3) accommodating infinitary syntax and non-equivariant predicates.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Editors: |
|
Copyright, Publisher and Additional Information: | © 2025 Copyright held by the owner/author(s). This work is licensed under a Creative Commons Attribution 4.0 International License (https://creativecommons.org/licenses/by/4.0/). |
Keywords: | formal reasoning; induction; nominal sets; syntax with bindings |
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: | 30 Jan 2025 14:36 |
Last Modified: | 30 Jan 2025 14:36 |
Status: | Published |
Publisher: | Association for Computing Machinery (ACM) |
Refereed: | Yes |
Identification Number: | 10.1145/3704893 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:222673 |