[IEEE 2012 27th Annual IEEE Symposium on Logic in Computer Science (LICS 2012) - Dubrovnik, Croatia (2012.06.25-2012.06.28)] 2012 27th Annual IEEE Symposium on Logic in Computer Science - Inductive Types in Homotopy Type Theory

✍ Scribed by Awodey, Steve; Gambino, Nicola; Sojakova, Kristina

• Book ID: 120020801
• Publisher: IEEE
• Year: 2012
• Weight: 244 KB
• Category: Article
• ISBN: 0769547699
• DOI: 10.1109/LICS.2012.21

✦ Synopsis

Homotopy type theory is an interpretation of Martin-Löf'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 wellfounded 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.