A general theory of syntax with bindings

Gheri, Lorenzo (2019) A general theory of syntax with bindings. PhD thesis, Middlesex University. [Thesis]

PDF - Final accepted version (with author's formatting)
Download (812kB) | Preview


In this thesis we give a general theory of syntax with bindings. We address the problem from a mathematical point of view and at the same time we give a formalization, in the Isabelle/HOL proof assistant.

Our theory uses explicit names for variables, and then deals with alpha-equivalence classes, remaining intuitive and close to informal mathematics, although being fully formalized and sound in classical high-order logic. In this sense it can be regarded as a generalization of nominal logic. Our end product can be used to construct complex binding patterns and binding-aware datatypes, including non-well-founded and infinitely branching types, in a modular fashion. We provide definitions of the fundamental operators on terms (free variables, alpha-equivalence, and capture-avoiding substitution) and reasoning and definition
principles, obeying Barendregt’s convention.

We present our work as a thinking process that starts from some desiderata, and then evolves in different formalization stages for the general theory. We start by taking a “universal algebra” approach, modelling syntaxes via algebraic-style binding signatures, which we employ in a substantial case study on formal reasoning: Church-Rosser and standardization theorems for lamda-calculus. This solution proves itself too restrictive, so we refine it into a more flexible one, which constitutes the main original contribution of this thesis: We construct a universe of functors on sets that handle bindings on a general, flexible and modular level.

Our functors do not commit to any a priori syntactic format, cater for codatatypes in addition to datatypes, and are supported by powerful definition and reasoning principles. They generalize the bounded natural functors (BNFs), which have been previously implemented in Isabelle/HOL to support (co)datatypes.

Item Type: Thesis (PhD)
Research Areas: A. > School of Science and Technology > Computer Science
B. > Theses
Item ID: 26916
Depositing User: Brigitte Joerg
Date Deposited: 05 Jul 2019 14:17
Last Modified: 05 Jul 2019 15:24
URI: https://eprints.mdx.ac.uk/id/eprint/26916

Actions (login required)

View Item View Item