A General Theory of Syntax with Bindings


Title: A General Theory of Syntax with Bindings
Authors: Lorenzo Gheri (lor /dot/ gheri /at/ gmail /dot/ com) and Andrei Popescu (a /dot/ popescu /at/ mdx /dot/ ac /dot/ uk)
Submission date: 2019-04-06
Abstract: We formalize a theory of syntax with bindings that has been developed and refined over the last decade to support several large formalization efforts. Terms are defined for an arbitrary number of constructors of varying numbers of inputs, quotiented to alpha-equivalence and sorted according to a binding signature. The theory includes many properties of the standard operators on terms: substitution, swapping and freshness. It also includes bindings-aware induction and recursion principles and support for semantic interpretation. This work has been presented in the ITP 2017 paper “A Formalized General Theory of Syntax with Bindings”.
  author  = {Lorenzo Gheri and Andrei Popescu},
  title   = {A General Theory of Syntax with Bindings},
  journal = {Archive of Formal Proofs},
  month   = apr,
  year    = 2019,
  note    = {\url{http://isa-afp.org/entries/Binding_Syntax_Theory.html},
            Formal proof development},
  ISSN    = {2150-914x},
License: BSD License
Status: [ok] This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.