Variable binding and substitution for (nameless) dummies

DOI10.1007/978-3-030-99253-8_20arXiv2209.02614OpenAlexW4225986717MaRDI QIDQ6181939

Andre Hirschowitz, Ambroise Lafont, Marco Maggesi, Tom Hirschowitz

Publication date: 23 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.02614

zbMATH Keywords

category theorysyntaxsubstitutionvariable binding

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Skew-monoidal categories and bialgebroids.
• Modules over monads and initial semantics
• On the construction of free algebras for equational systems
• A formalized general theory of syntax with bindings: extended version
• Autosubst: Reasoning with de Bruijn Terms and Parallel Substitutions
• Second-Order Equational Logic (Extended Abstract)
• Modules over Monads and Linearity
• de Bruijn notation as a nested datatype
• A type- and scope-safe universe of syntaxes with binding: their semantics and proofs
• A Cellular Howe Theorem
• Monads need not be endofunctors
• Abstract Syntax: Substitution and Binders

This page was built for publication: Variable binding and substitution for (nameless) dummies