Foundational nonuniform (Co)datatypes for higher-order logic - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

Foundational nonuniform (Co)datatypes for higher-order logic


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.
Fichier principal
Vignette du fichier
conf.pdf (259.64 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01599174 , version 1 (01-10-2017)



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⟩
106 View
93 Download



Gmail Facebook X LinkedIn More