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.
Chapter PDF
Similar content being viewed by others
References
Allais, G., Atkey, R., Chapman, J., McBride, C., McKinna, J.: A type and scope safe universe of syntaxes with binding: their semantics and proofs. Proceedings of the ACM on Programming Languages 2(ICFP), 90:1–90:30 (2018). https://doi.org/10.1145/3236785
Altenkirch, T., Chapman, J., Uustalu, T.: Monads need not be endofunctors. Logical Methods in Computer Science 11(1) (2015). https://doi.org/10.2168/LMCS-11(1:3)2015
Arkor, N., McDermott, D.: Abstract clones for abstract syntax. In: Kobayashi, N. (ed.) Proc. 6th International Conference on Formal Structures for Computation and Deduction. Leibniz International Proceedings in Informatics (LIPIcs), vol. 195, pp. 30:1–30:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021). https://doi.org/10.4230/LIPIcs.FSCD.2021.30
Berghofer, S., Urban, C.: A head-to-head comparison of de bruijn indices and names. Electronic Notes in Theoretical Computer Science 174(5), 53–67 (2007). https://doi.org/10.1016/j.entcs.2007.01.018
Bird, R.S., Paterson, R.: De bruijn notation as a nested datatype. Journal of Functional Programming 9(1), 77–91 (1999). https://doi.org/10.1017/S0956796899003366
Borthelle, P., Hirschowitz, T., Lafont, A.: A cellular Howe theorem. In: Hermanns, H., Zhang, L., Kobayashi, N., Miller, D. (eds.) Proc. 35th ACM/IEEE Symposium on Logic in Computer Science ACM (2020). https://doi.org/10.1145/3373718.3394738
Fiore, M.P., Hur, C.K.: Second-order equational logic. In: Proceedings of the 19th EACSL Annual Conference on Computer Science Logic (CSL 2010) (2010)
Fiore, M., Hur, C.K.: On the construction of free algebras for equational systems. Theoretical Computer Science 410, 1704–1729 (2009)
Fiore, M., Szamozvancev, D.: Formal metatheory of second-order abstract syntax. Proceedings of the ACM on Programming Languages 6(POPL) (2022). https://doi.org/10.1145/3498715
Fiore, M.P.: Second-order and dependently-sorted abstract syntax. In: LICS. pp. 57–68. IEEE (2008). https://doi.org/10.1109/LICS.2008.38
Fiore, M.P., Plotkin, G.D., Turi, D.: Abstract syntax and variable binding. In: Proc. 14th Symposium on Logic in Computer Science IEEE (1999)
Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax involving binders. In: Proc. 14th Symposium on Logic in Computer Science IEEE (1999)
Gheri, L., Popescu, A.: A formalized general theory of syntax with bindings: Extended version. Journal of Automated Reasoning 64(4), 641–675 (2020). https://doi.org/10.1007/s10817-019-09522-2
Hirschowitz, A., Hirschowitz, T., Lafont, A.: Modules over monads and operational semantics. In: Ariola, Z.M. (ed.) Proc. 5th International Conference on Formal Structures for Computation and Deduction. Leibniz International Proceedings in Informatics (LIPIcs), vol. 167, pp. 12:1–12:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020). https://doi.org/10.4230/LIPIcs.FSCD.2020.12
Hirschowitz, A., Hirschowitz, T., Lafont, A.: Modules over monads and operational semantics (2021), submitted expanded version of [14]
Hirschowitz, A., Hirschowitz, T., Lafont, A., Maggesi, M.: Variable binding and substitution for (nameless) dummies (2021), https://amblafont.github.io/articles/debruijn-extended.pdf, preprint
Hirschowitz, A., Maggesi, M.: Modules over monads and linearity. In: Proc. 14th International Workshop on Logic, Language, Information and Computation LNCS, vol. 4576, pp. 218–237. Springer (2007). https://doi.org/10.1007/3-540-44802-0_3
Hirschowitz, A., Maggesi, M.: Modules over monads and initial semantics. Information and Computation 208(5), 545–564 (2010). https://doi.org/10.1016/j.ic.2009.07.003
Hofmann, M.: Semantical analysis of higher-order abstract syntax. In: Proc. 14th Symposium on Logic in Computer Science IEEE (1999)
Lafont, A.: Initial algebra semantics for de Bruijn monads in Coq. https://github.com/amblafont/binding-debruijn (2021)
Mac Lane, S.: Categories for the Working Mathematician. No. 5 in Graduate Texts in Mathematics, Springer, 2nd edn. (1998)
Maggesi, M.: Initial algebra semantics for de Bruijn monads in HOL Light. https://github.com/maggesi/dbmonad/tree/master/De_Bruijn (2021)
Plotkin, G.: An illative theory of relations. In: Cooper, R., et al. (eds.) Situation Theory and its Applications. p. 133–146. No. 22 in CSLI Lecture Notes, Stanford University (1990)
Power, J.: Abstract syntax: Substitution and binders: Invited address. Electronic Notes in Theoretical Computer Science 173, 3–16 (04 2007). https://doi.org/10.1016/j.entcs.2007.02.024
Sangiorgi, D., Walker, D.: The \(\pi \)-calculus – A Theory of Mobile Processes. Cambridge University Press (2001)
Schäfer, S., Tebbi, T., Smolka, G.: Autosubst: Reasoning with de Bruijn terms and parallel substitutions. In: Urban, C., Zhang, X. (eds.) Proc. 6th International Conference on Interactive Theorem Proving. LNCS, vol. 9236, pp. 359–374. Springer (2015). https://doi.org/10.1007/978-3-319-22102-1_24
Stark, K., Schäfer, S., Kaiser, J.: Autosubst 2: reasoning with multi-sorted de bruijn terms and vector substitutions. In: Mahboubi, A., Myreen, M.O. (eds.) Proc. 8th International Conference on Certified Programs and Proofs. pp. 166–180. ACM (2019). https://doi.org/10.1145/3293880.3294101
Szlachányi, K.: Skew-monoidal categories and bialgebroids. Advances in Mathematics 231, 1694–1730 (2012). https://doi.org/10.1016/j.aim.2012.06.027
Trnková, V.: Some properties of set functors. Commentationes Mathematicæ Universitatis Carolinæ 10(2), 323–352 (1969)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
Copyright information
© 2022 The Author(s)
About this paper
Cite this paper
Hirschowitz, A., Hirschowitz, T., Lafont, A., Maggesi, M. (2022). Variable binding and substitution for (nameless) dummies. In: Bouyer, P., Schröder, L. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 2022. Lecture Notes in Computer Science, vol 13242. Springer, Cham. https://doi.org/10.1007/978-3-030-99253-8_20
Download citation
DOI: https://doi.org/10.1007/978-3-030-99253-8_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-99252-1
Online ISBN: 978-3-030-99253-8
eBook Packages: Computer ScienceComputer Science (R0)