 |
 |
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)2024Variable binding and substitution for (nameless) dummiesArticle
Authors: André ; Hirschowitz ; Tom Hirschowitz 
; Ambroise Lafont ; Marco Maggesi
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.
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
Funding:
- Source : OpenAIRE Graph
- Foundations of Type Inference for Modern Programming Languages; Funder: European Commission; Code: 101002277
Classifications
Mathematics Subject Classification 20201
- 03B70 - Logic in computer science
- 18C10 - Theories (e.g., algebraic theories), structure, and semantics
- 18C15 - Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads
- 68-XX - Computer science
- 68N15 - Theory of programming languages
- 68N18 - Functional programming and lambda calculus
- 68N30 - Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Consultation statistics
This page has been seen 2824 times.
This article's PDF has been downloaded 758 times.