Bindings as bounded natural functors

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-fou...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings of ACM on programming languages Ročník 3; číslo POPL; s. 1 - 34
Hlavní autoři: Blanchette, Jasmin Christian, Gheri, Lorenzo, Popescu, Andrei, Traytel, Dmitriy
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY, USA ACM 02.01.2019
Témata:
Computer Science
Higher order logic
Logic
Logic and verification
Logic in Computer Science
Program constructs
Semantics and reasoning
Theory of computation
Type structures
syntax with bindings
proof assistants
inductive and coinductive datatypes
Type struc-tures
Theory of computation → Logic and verification
Higher order logic
ISSN:2475-1421, 2475-1421
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:2475-1421
2475-1421
DOI:10.1145/3290335