Nominal techniques as an Agda library
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917312994476032 |
|---|---|
| author | Gabbay, Murdoch J. Melkonian, Orestis |
| author_facet | Gabbay, Murdoch J. Melkonian, Orestis |
| contents | Nominal techniques provide a mathematically principled approach to dealing with names and variable binding in programming languages. This paper explores an attempt to make nominal techniques accessible as an Agda library. We aim for a technical victory of implementing nominal ideas; we further require a moral victory that the overhead be acceptable for practical systems. The results of this paper have been mechanised and are publicly accessible at https://omelkonian.github.io/nominal-agda/. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_03968 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Nominal techniques as an Agda library Gabbay, Murdoch J. Melkonian, Orestis Programming Languages Logic in Computer Science 03B35, 03B70, 68Q60 F.3.1; F.4.1; D.3.1 Nominal techniques provide a mathematically principled approach to dealing with names and variable binding in programming languages. This paper explores an attempt to make nominal techniques accessible as an Agda library. We aim for a technical victory of implementing nominal ideas; we further require a moral victory that the overhead be acceptable for practical systems. The results of this paper have been mechanised and are publicly accessible at https://omelkonian.github.io/nominal-agda/. |
| title | Nominal techniques as an Agda library |
| topic | Programming Languages Logic in Computer Science 03B35, 03B70, 68Q60 F.3.1; F.4.1; D.3.1 |
| url | https://arxiv.org/abs/2603.03968 |