Variable binding and substitution for (nameless) dummies
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2022
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911977915285504 |
|---|---|
| author | Hirschowitz, André Hirschowitz, Tom Lafont, Ambroise Maggesi, Marco |
| author_facet | Hirschowitz, André Hirschowitz, Tom Lafont, Ambroise Maggesi, Marco |
| contents | By abstracting over well-known properties of De Bruijn's representation with nameless dummies, we design a new theory of syntax with variable binding and capture-avoiding substitution. We propose it as a simpler alternative to Fiore, Plotkin, and Turi's approach, with which we establish a strong formal link. We also show that our theory easily incorporates simple types and equations between terms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2209_02614 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Variable binding and substitution for (nameless) dummies Hirschowitz, André Hirschowitz, Tom Lafont, Ambroise Maggesi, Marco Logic in Computer Science By abstracting over well-known properties of De Bruijn's representation with nameless dummies, we design a new theory of syntax with variable binding and capture-avoiding substitution. We propose it as a simpler alternative to Fiore, Plotkin, and Turi's approach, with which we establish a strong formal link. We also show that our theory easily incorporates simple types and equations between terms. |
| title | Variable binding and substitution for (nameless) dummies |
| topic | Logic in Computer Science |
| url | https://arxiv.org/abs/2209.02614 |