André Hirschowitz ; Tom Hirschowitz ; Ambroise Lafont ; Marco Maggesi - Variable binding and substitution for (nameless) dummies

lmcs:10008 - Logical Methods in Computer Science, March 1, 2024, Volume 20, Issue 1 - https://doi.org/10.46298/lmcs-20(1:18)2024
Variable binding and substitution for (nameless) dummiesArticle

Authors: André ; Hirschowitz ; Tom Hirschowitz ORCID; Ambroise Lafont ORCID; Marco Maggesi ORCID

    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.

    https://doi.org/10.46298/lmcs-20(1:18)2024
    Source: arXiv.org:2209.02614
    Volume: Volume 20, Issue 1
    Published on: March 1, 2024
    Accepted on: December 23, 2023
    Submitted on: September 7, 2022
    Keywords: Computer Science - Logic in Computer Science
    Licence: Attribution 4.0 International (CC BY 4.0)

    Classifications

    Mathematics Subject Classification 20201
    Sources:
    • [1] zbMATH Open.

    Share and export

    Consultation statistics

    This page has been seen 1312 times.
    This article's PDF has been downloaded 337 times.