• DocumentCode
    3092411
  • Title

    Inductive Types in Homotopy Type Theory

  • Author

    Awodey, Steve ; Gambino, Nicola ; Sojakova, Kristina

  • Author_Institution
    Dept. of Philos., Carnegie Mellon Univ., Pittsburgh, PA, USA
  • fYear
    2012
  • fDate
    25-28 June 2012
  • Firstpage
    95
  • Lastpage
    104
  • Abstract
    Homotopy type theory is an interpretation of Martin-Lof´s constructive type theory into abstract homotopy theory. There results a link between constructive mathematics and algebraic topology, providing topological semantics for intensional systems of type theory as well as a computational approach to algebraic topology via type theory-based proof assistants such as Coq. The present work investigates inductive types in this setting. Modified rules for inductive types, including types of well-founded trees, or W-types, are presented, and the basic homotopical semantics of such types are determined. Proofs of all results have been formally verified by the Coq proof assistant, and the proof scripts for this verification form an essential component of this research.
  • Keywords
    algebra; programming language semantics; topology; trees (mathematics); type theory; Coq proof assistant; Martin-Lof constructive type theory; W-types; abstract homotopy theory; algebraic topology; computational approach; constructive mathematics; homotopical semantics; homotopy type theory; inductive type; intensional system; proof script; topological semantics; type theory-based proof assistant; well-founded trees; Algebra; Educational institutions; Polynomials; Semantics; Standards; Topology; Type theory; homotopy theory; initial algebras;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logic in Computer Science (LICS), 2012 27th Annual IEEE Symposium on
  • Conference_Location
    Dubrovnik
  • ISSN
    1043-6871
  • Print_ISBN
    978-1-4673-2263-8
  • Type

    conf

  • DOI
    10.1109/LICS.2012.21
  • Filename
    6280428