date: 2019-02-01T07:36:43Z
pdf:PDFVersion: 1.5
pdf:docinfo:title: Bindings as Bounded Natural Functors
xmp:CreatorTool: LaTeX with acmart 2018/10/20 v1.55 Typesetting articles for the Association for Computing Machinery and hyperref 2017/03/14 v6.85a Hypertext links for LaTeX
access_permission:can_print_degraded: true
subject: -  Theory of computation  ->  Logic and verification; Higher order logic; Type structures; 
dc:format: application/pdf; version=1.5
pdf:docinfo:creator_tool: LaTeX with acmart 2018/10/20 v1.55 Typesetting articles for the Association for Computing Machinery and hyperref 2017/03/14 v6.85a Hypertext links for LaTeX
access_permission:fill_in_form: true
pdf:encrypted: false
dc:title: Bindings as Bounded Natural Functors
modified: 2019-02-01T07:36:43Z
cp:subject: -  Theory of computation  ->  Logic and verification; Higher order logic; Type structures; 
pdf:docinfo:subject: -  Theory of computation  ->  Logic and verification; Higher order logic; Type structures; 
pdf:docinfo:creator: Jasmin Christian Blanchette, Lorenzo Gheri, Andrei Popescu, and Dmitriy Traytel
PTEX.Fullbanner: This is pdfTeX, Version 3.14159265-2.6-1.40.18 (TeX Live 2017) kpathsea version 6.2.3
meta:author: Jasmin Christian Blanchette, Lorenzo Gheri, Andrei Popescu, and Dmitriy Traytel
meta:creation-date: 2018-11-23T22:57:41Z
created: 2018-11-23T22:57:41Z
access_permission:extract_for_accessibility: true
Creation-Date: 2018-11-23T22:57:41Z
Author: Jasmin Christian Blanchette, Lorenzo Gheri, Andrei Popescu, and Dmitriy Traytel
producer: pdfTeX-1.40.18
pdf:docinfo:producer: pdfTeX-1.40.18
pdf:unmappedUnicodeCharsPerPage: 0
dc:description: -  Theory of computation  ->  Logic and verification; Higher order logic; Type structures; 
Keywords: syntax with bindings, inductive and coinductive datatypes, proof assistants
access_permission:modify_annotations: true
dc:creator: Jasmin Christian Blanchette, Lorenzo Gheri, Andrei Popescu, and Dmitriy Traytel
description: -  Theory of computation  ->  Logic and verification; Higher order logic; Type structures; 
dcterms:created: 2018-11-23T22:57:41Z
Last-Modified: 2019-02-01T07:36:43Z
dcterms:modified: 2019-02-01T07:36:43Z
title: Bindings as Bounded Natural Functors
xmpMM:DocumentID: uuid:9d4dcd8f-3b9a-11f4-0000-3a8e678976c8
Last-Save-Date: 2019-02-01T07:36:43Z
pdf:docinfo:keywords: syntax with bindings, inductive and coinductive datatypes, proof assistants
pdf:docinfo:modified: 2019-02-01T07:36:43Z
meta:save-date: 2019-02-01T07:36:43Z
pdf:docinfo:custom:PTEX.Fullbanner: This is pdfTeX, Version 3.14159265-2.6-1.40.18 (TeX Live 2017) kpathsea version 6.2.3
Content-Type: application/pdf
X-Parsed-By: org.apache.tika.parser.DefaultParser
creator: Jasmin Christian Blanchette, Lorenzo Gheri, Andrei Popescu, and Dmitriy Traytel
dc:subject: syntax with bindings, inductive and coinductive datatypes, proof assistants
access_permission:assemble_document: true
xmpTPg:NPages: 34
pdf:charsPerPage: 3418
access_permission:extract_content: true
access_permission:can_print: true
meta:keyword: syntax with bindings, inductive and coinductive datatypes, proof assistants
access_permission:can_modify: true
pdf:docinfo:created: 2018-11-23T22:57:41Z