Variable binding and substitution for (nameless) dummies
Andr\'e Hirschowitz, Tom Hirschowitz, Ambroise Lafont, Marco Maggesi

TL;DR
This paper introduces a simplified theory of syntax with variable binding and capture-avoiding substitution using De Bruijn's nameless dummies, providing a formal link to existing approaches and accommodating simple types and equations.
Contribution
It presents a new, simpler framework for variable binding and substitution that connects to established theories and extends to include simple types and equations.
Findings
Establishes a formal link to Fiore, Plotkin, and Turi's approach
Easily incorporates simple types and equations
Provides a simpler alternative to existing theories
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 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Logic, programming, and type systems · Syntax, Semantics, Linguistic Variation
