Bindings as Bounded Natural Functors

Abstract : the Romanian Academy, Romania DMITRIY TRAYTEL, ETH Zürich, Switzerland We present a general framework for specifying and reasoning about syntax with bindings. Abstract binder types are modeled using a universe of functors on sets, subject to a number of operations that can be used to construct complex binding patterns and binding-aware datatypes, including non-well-founded and infinitely branching types, in a modular fashion. Despite not committing to any syntactic format, the framework is "concrete" enough to provide definitions of the fundamental operators on terms (free variables, alpha-equivalence, and capture-avoiding substitution) and reasoning and definition principles. This work is compatible with classical higher-order logic and has been formalized in the proof assistant Isabelle/HOL.
Type de document :
Article dans une revue
Proceedings of the ACM on Programming Languages, ACM, 2019, 3 (POPL), pp.1-34. 〈10.1145/3290335〉
Liste complète des métadonnées

Littérature citée [9 références]  Voir  Masquer  Télécharger
Contributeur : Jasmin Christian Blanchette <>
Soumis le : mardi 22 janvier 2019 - 15:15:47
Dernière modification le : mardi 19 février 2019 - 15:40:04


Fichiers produits par l'(les) auteur(s)




Jasmin Christian Blanchette, Lorenzo Gheri, Andrei Popescu, Dmitriy Traytel. Bindings as Bounded Natural Functors. Proceedings of the ACM on Programming Languages, ACM, 2019, 3 (POPL), pp.1-34. 〈10.1145/3290335〉. 〈hal-01989726〉



Consultations de la notice


Téléchargements de fichiers