Homotopy Type Theory an Overview (Unfinished)
Homotopy Type Theory An Overview (unfinished) Nicolai Kraus Tue Jun 19 19:29:30 UTC 2012 Preface This composition is an introduction to a fairly new field in between of math- ematics and theoretical computer science, mostly referred to as Homotopy Type Theory. The foundations for this subject were, in some way, laid by an article of Hofmann and Streicher [21] 1 by showing that in Intentional Type Theory, it is reasonable to consider different proofs of the same identity. Their strategy was to use groupoids for an interpretation of type theory. Pushing this idea forward, Lumsdaine [31] and van den Berg & Garner [8] noticed independently that a type bears the structure of a weak omega groupoid, a structure that is well-known in algebraic topology. In recent years, Voevodsky proposed his Univalence axiom, basically aiming to ensure nice behaviours like the ones found in homotopy theory. Claiming that set theory has inherent disadvantages, he started to develop his Univalent Foundations of Mathematics, drawing a notable amount of at- tention from researchers in many different fields: homotopy theory, construc- tive logic, type theory and higher dimensional category theory, to mention the most important. This introduction mainly consists of the first part of my first year report, which can be found on my homepage2 (as well as updates of this composition itself). Originally, my motivation for writing up these contents has been to teach them to myself. At the same time, I had to notice that no detailed written introduction seems to exist, maybe due to the fact that the research branch is fairly new.
[Show full text]