Binder Aware Recursion over Well-Scoped de Bruijn Syntax
The de~Bruijn representation of syntax with binding is commonly used, but flawed when it comes to recursion. As the structural recursion principle associated to an inductive type of expressions is unaware of the binding discipline, each recursive definition requires a separate proof of compatibility with variable instantiation. We solve this problem by extending Allais' notion of syntax traversals to obtain a framework for instantiation-compatible recursion. The framework is general enough to handle multivariate, potentially mutually recursive syntactic systems.
With our framework we define variable renaming and instantiation, syntax directed typing and certain unary logical relations for System~F. These definitons lead to concise proofs of type preservation, as well as weak and strong normalisation.
Our framework is designed to serve as the theoretical foundation of future versions of the Autosubst Coq library. All developments and case studies are formalised in the Coq proof assistant.
Tue 9 JanDisplayed time zone: Tijuana, Baja California change
16:00 - 18:00
|HOpi in Coq|
|A Coq Formalization of Normalization by Evaluation for Martin-Löf Type Theory|
|A Two-Level Logic Perspective on (Simultaneous) Substitutions|
Kaustuv Chaudhuri Inria, FranceDOI
|Binder Aware Recursion over Well-Scoped de Bruijn Syntax|