Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2510.12304 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866909844499333120 |
|---|---|
| author | Altenkirch, Thorsten Burke, Nathaniel Wadler, Philip |
| author_facet | Altenkirch, Thorsten Burke, Nathaniel Wadler, Philip |
| contents | Defining substitution for a language with binders like the simply typed $λ$-calculus requires repetition, defining substitution and renaming separately. To verify the categorical properties of this calculus, we must repeat the same argument many times. We present a lightweight method that avoids repetition and that gives rise to a simply typed category with families (CwF) isomorphic to the initial simply typed CwF. Our paper is a literate Agda script. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_12304 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Substitution Without Copy and Paste Altenkirch, Thorsten Burke, Nathaniel Wadler, Philip Logic in Computer Science Defining substitution for a language with binders like the simply typed $λ$-calculus requires repetition, defining substitution and renaming separately. To verify the categorical properties of this calculus, we must repeat the same argument many times. We present a lightweight method that avoids repetition and that gives rise to a simply typed category with families (CwF) isomorphic to the initial simply typed CwF. Our paper is a literate Agda script. |
| title | Substitution Without Copy and Paste |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2510.12304 |