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.
2024
20
0
0
Goal 11: Sustainable cities and communities
Hirschowitz A.; Hirschowitz T.; Lafont A.; Maggesi M.
File in questo prodotto:
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.

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/1366173
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact