Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2605.08990 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909029840715776 |
|---|---|
| author | Pitts, Andrew M. |
| author_facet | Pitts, Andrew M. |
| contents | When using interactive theorem provers based on dependent type theory to define and reason about languages involving binding constructs, we advocate the use of a well-scoped version of the locally nameless method of representing syntax. This paper describes generic code parameterized by a Plotkin-style binding signature for this style of syntax representation within the Agda theorem prover, gives a proof of its adequacy with respect to naive nameful syntax modulo alpha-conversion and discusses some examples of its use. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_08990 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Well-Scoped Locally Nameless Representation of Syntax Pitts, Andrew M. Logic in Computer Science F.4.1; D.3.1 When using interactive theorem provers based on dependent type theory to define and reason about languages involving binding constructs, we advocate the use of a well-scoped version of the locally nameless method of representing syntax. This paper describes generic code parameterized by a Plotkin-style binding signature for this style of syntax representation within the Agda theorem prover, gives a proof of its adequacy with respect to naive nameful syntax modulo alpha-conversion and discusses some examples of its use. |
| title | Well-Scoped Locally Nameless Representation of Syntax |
| topic | Logic in Computer Science F.4.1; D.3.1 |
| url | https://arxiv.org/abs/2605.08990 |