Foundational nonuniform (Co)datatypes for higher-order logic

Abstract : Nonuniform (or " nested " or " heterogeneous ") data-types are recursively defined types in which the type arguments vary recursively. They arise in the implementation of finger trees and other efficient functional data structures. We show how to reduce a large class of nonuniform datatypes and codatatypes to uniform types in higher-order logic. We programmed this reduction in the Isabelle/HOL proof assistant, thereby enriching its specification language. Moreover, we derive (co)induction and (co)recursion principles based on a weak variant of parametricity.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [39 references]  Display  Hide  Download

https://hal.inria.fr/hal-01599174
Contributor : Jasmin Christian Blanchette <>
Submitted on : Sunday, October 1, 2017 - 6:53:00 PM
Last modification on : Wednesday, April 3, 2019 - 1:23:13 AM

File

conf.pdf
Files produced by the author(s)

Identifiers

Citation

Jasmin Christian Blanchette, Fabian Meier, Andrei Popescu, Dmitriy Traytel. Foundational nonuniform (Co)datatypes for higher-order logic. LICS 2017: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, Jun 2017, Reykjavik, Iceland. pp.1 - 12, ⟨10.1109/LICS.2017.8005071⟩. ⟨hal-01599174⟩

Share

Metrics

Record views

172

Files downloads

32