Abstract
We present the formalization of 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 a rich collection of properties of the standard operators on terms, such as substitution and freshness. It also includes induction and recursion principles and support for semantic interpretation, all tailored for smooth interaction with the bindings and the standard operators.
Cite
CITATION STYLE
Gheri, L., & Popescu, A. (2017). A formalized general theory of syntax with bindings. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10499 LNCS, pp. 241–261). Springer Verlag. https://doi.org/10.1007/978-3-319-66107-0_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
