Year: 2017
Type: conference-paper
Abstract: Nonuniform (or “nested” or “heterogeneous”) datatypes 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.
Institutions: Institut national de recherche en sciences et technologies du numérique, Max Planck Institute for Informatics, Laboratoire Lorrain de Recherche en Informatique et ses Applications, VERIDIS: Modeling and Verification of Distributed Algorithms and Systems, Vrije Universiteit Amsterdam, Google (Switzerland), Institute of Information Security, Middlesex University London, ETH Zurich
Language: English
Subfield: Software
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W4239300366