Ambrus Kaposi ; András Kovács - Signatures and Induction Principles for Higher Inductive-Inductive Types

lmcs:5173 - Logical Methods in Computer Science, February 13, 2020, Volume 16, Issue 1 -
Signatures and Induction Principles for Higher Inductive-Inductive Types

Authors: Ambrus Kaposi ; András Kovács

    Higher inductive-inductive types (HIITs) generalize inductive types of dependent type theories in two ways. On the one hand they allow the simultaneous definition of multiple sorts that can be indexed over each other. On the other hand they support equality constructors, thus generalizing higher inductive types of homotopy type theory. Examples that make use of both features are the Cauchy real numbers and the well-typed syntax of type theory where conversion rules are given as equality constructors. In this paper we propose a general definition of HIITs using a small type theory, named the theory of signatures. A context in this theory encodes a HIIT by listing the constructors. We also compute notions of induction and recursion for HIITs, by using variants of syntactic logical relation translations. Building full categorical semantics and constructing initial algebras is left for future work. The theory of HIIT signatures was formalised in Agda together with the syntactic translations. We also provide a Haskell implementation, which takes signatures as input and outputs translation results as valid Agda code.

    Volume: Volume 16, Issue 1
    Published on: February 13, 2020
    Accepted on: February 13, 2020
    Submitted on: February 6, 2019
    Keywords: Computer Science - Logic in Computer Science

    Linked data

    Source : ScholeXplorer IsCitedBy DOI 10.4230/lipics.types.2021.10
    • 10.4230/lipics.types.2021.10
    Quantitative Polynomial Functors
    Nakov, Georgi ; Nordvall Forsberg, Fredrik ;


    Consultation statistics

    This page has been seen 691 times.
    This article's PDF has been downloaded 819 times.