A Formalized General Theory of Syntax with Bindings
Logic in Computer Science
2017-07-04 v1
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.
Keywords
Cite
@article{arxiv.1707.00024,
title = {A Formalized General Theory of Syntax with Bindings},
author = {Lorenzo Gheri and Andrei Popescu},
journal= {arXiv preprint arXiv:1707.00024},
year = {2017}
}
Comments
Extended version of paper published in ITP 2017