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 captureavoiding 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.
Variable binding and substitution for (nameless) dummies / Hirschowitz A.; Hirschowitz T.; Lafont A.; Maggesi M.. - In: LOGICAL METHODS IN COMPUTER SCIENCE. - ISSN 1860-5974. - ELETTRONICO. - 20:(2024), pp. 0-0. [10.46298/lmcs-20(1:18)2024]
Variable binding and substitution for (nameless) dummies
Maggesi M.
2024
Abstract
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 captureavoiding 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.File | Dimensione | Formato | |
---|---|---|---|
2209.02614.pdf
accesso aperto
Tipologia:
Pdf editoriale (Version of record)
Licenza:
Creative commons
Dimensione
658.97 kB
Formato
Adobe PDF
|
658.97 kB | Adobe PDF |
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.