Patricia Johann ; Enrico Ghiorzi - Parametricity for Nested Types and GADTs

lmcs:7086 - Logical Methods in Computer Science, December 23, 2021, Volume 17, Issue 4 -
Parametricity for Nested Types and GADTsArticle

Authors: Patricia Johann ; Enrico Ghiorzi ORCID

    This paper considers parametricity and its consequent free theorems for nested data types. Rather than representing nested types via their Church encodings in a higher-kinded or dependently typed extension of System F, we adopt a functional programming perspective and design a Hindley-Milner-style calculus with primitives for constructing nested types directly as fixpoints. Our calculus can express all nested types appearing in the literature, including truly nested types. At the level of terms, it supports primitive pattern matching, map functions, and fold combinators for nested types. Our main contribution is the construction of a parametric model for our calculus. This is both delicate and challenging. In particular, to ensure the existence of semantic fixpoints interpreting nested types, and thus to establish a suitable Identity Extension Lemma for our calculus, our type system must explicitly track functoriality of types, and cocontinuity conditions on the functors interpreting them must be appropriately threaded throughout the model construction. We also prove that our model satisfies an appropriate Abstraction Theorem, as well as that it verifies all standard consequences of parametricity in the presence of primitive nested types. We give several concrete examples illustrating how our model can be used to derive useful free theorems, including a short cut fusion transformation, for programs over nested types. Finally, we consider generalizing our results to GADTs, and argue that no extension of our parametric model for nested types can give a functorial interpretation of GADTs in terms of left Kan extensions and still be parametric.

    Volume: Volume 17, Issue 4
    Published on: December 23, 2021
    Accepted on: October 21, 2021
    Submitted on: January 14, 2021
    Keywords: Computer Science - Logic in Computer Science
      Source : OpenAIRE Graph
    • SHF: Small: Relational Parametricity for Program Verification; Funder: National Science Foundation; Code: 1420175
    • SHF:Small:RUI: Semantic Complexity of Advanced Data Types; Funder: National Science Foundation; Code: 1906388


    Consultation statistics

    This page has been seen 696 times.
    This article's PDF has been downloaded 215 times.