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

Full description

Bibliographic Details

Published in:	Proceedings of ACM on programming languages Vol. 3; no. POPL; pp. 1 - 34
Main Authors:	Blanchette, Jasmin Christian, Gheri, Lorenzo, Popescu, Andrei, Traytel, Dmitriy
Format:	Journal Article
Language:	English
Published:	New York, NY, USA ACM 02.01.2019
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!