Variable binding and substitution for (nameless) dummies

09/06/2022
by   andre, et al.
0

By abstracting over well-known properties of De Bruijn's representation with nameless dummies, we design a new theory of syntax with variable binding and capture-avoiding substitution. We propose it as a simpler alternative to Fiore, Plotkin, and Turi's approach, with which we establish a strong formal link. We also show that our theory easily incorporates simple types and equations between terms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/18/2022

Rensets and Renaming-Based Recursion for Syntax with Bindings

I introduce renaming-enriched sets (rensets for short), which are algebr...
research
01/10/2022

Formal Metatheory of Second-Order Abstract Syntax

Despite extensive research both on the theoretical and practical fronts,...
research
07/05/2018

Abstract Representation of Binders in OCaml using the Bindlib Library

The Bindlib library for OCaml provides a set of tools for the manipulati...
research
07/12/2023

Internal parametricity, without an interval

Parametricity is a property of the syntax of type theory implying e.g. t...
research
04/28/2021

A Mechanised Proof of Gödel's Incompleteness Theorems using Nominal Isabelle

An Isabelle/HOL formalisation of Gödel's two incompleteness theorems is ...
research
08/10/2023

Substitution for Non-Wellfounded Syntax with Binders

We describe a generic construction of non-wellfounded syntax involving v...
research
07/18/2023

Towards a geometry for syntax

It often happens that free algebras for a given theory satisfy useful re...

Please sign up or login with your details

Forgot password? Click here to reset