A formalized general theory of syntax with bindings

Gheri, Lorenzo and Popescu, Andrei (2017) A formalized general theory of syntax with bindings. In: 8th International Conference Interactive Theorem Proving (ITP), 26-29 Sept 2017, Brasília, Brazil. (doi:10.1007/978-3-319-66107-0_16)

[img]
Preview
PDF - Final accepted version (with author's formatting)
Download (219kB) | Preview

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.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Cite this paper as: Gheri L., Popescu A. (2017) A Formalized General Theory of Syntax with Bindings. In: Ayala-Rincón M., Muñoz C. (eds) Interactive Theorem Proving. ITP 2017. Lecture Notes in Computer Science, vol 10499. Springer, Cham
Research Areas: A. > School of Science and Technology > Computer Science > Foundations of Computing group
Item ID: 22102
Notes on copyright: The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-66107-0_16
Useful Links:
Depositing User: Andrei Popescu
Date Deposited: 20 Jun 2017 15:57
Last Modified: 03 Apr 2019 17:53
ISBN: 9783319661063
URI: https://eprints.mdx.ac.uk/id/eprint/22102

Actions (login required)

Edit Item Edit Item

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year