Variable binding and substitution for (nameless) dummies - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Logical Methods in Computer Science Année : 2024

Variable binding and substitution for (nameless) dummies

Résumé

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.

Dates et versions

hal-04487704 , version 1 (04-03-2024)

Identifiants

Citer

André Hirschowitz, Tom Hirschowitz, Ambroise Lafont, Marco Maggesi. Variable binding and substitution for (nameless) dummies. Logical Methods in Computer Science, 2024, 20 (1), ⟨10.46298/lmcs-20(1:18)2024⟩. ⟨hal-04487704⟩
6 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More