Agda formalisation of the Introduction to Homotopy Type Theory
Agda
129
545 commits
updated Nov 27, 2021
This repository contains an Agda formalisation of the Introduction to Homotopy Type Theory book by Egbert Rijke.
There is one file per section in the book, and the formalization follows the book in a linear fashion. As far as we can, we make sure that numbering in the book of definitions, lemmas, theorems, etc, corresponds to numbering in the formal development.
ℕ at the end of its name. For example, we have zero-ℕ, one-ℕ, succ-ℕ, add-ℕ, mul-ℕ. We only use ℕ once at the end of a name. For instance, the fact that multiplication distributes from the left over addition is called left-distributive-mul-add-ℕ. Similar for structure on the integers, the finite sets, the rationals, and so on.Id, and we don't use infix notation for it. The only correct infix notation would be =, but this symbol is taken up by the core Agda program.hom-Group is the type of group homomorphisms between any two groups, and ℤ-Group is the object ℤ seen as a group.is-contr-map-is-equiv is the theorem that concludes that a map is contractible if it is an equivalence. Another example, type-Group is the underlying type of a group.532 commits
13 commits
Agda
100.0%
Agda formalisation of the Introduction to Homotopy Type Theory
Agda
129
545 commits
updated Nov 27, 2021
This repository contains an Agda formalisation of the Introduction to Homotopy Type Theory book by Egbert Rijke.
There is one file per section in the book, and the formalization follows the book in a linear fashion. As far as we can, we make sure that numbering in the book of definitions, lemmas, theorems, etc, corresponds to numbering in the formal development.
ℕ at the end of its name. For example, we have zero-ℕ, one-ℕ, succ-ℕ, add-ℕ, mul-ℕ. We only use ℕ once at the end of a name. For instance, the fact that multiplication distributes from the left over addition is called left-distributive-mul-add-ℕ. Similar for structure on the integers, the finite sets, the rationals, and so on.Id, and we don't use infix notation for it. The only correct infix notation would be =, but this symbol is taken up by the core Agda program.hom-Group is the type of group homomorphisms between any two groups, and ℤ-Group is the object ℤ seen as a group.is-contr-map-is-equiv is the theorem that concludes that a map is contractible if it is an equivalence. Another example, type-Group is the underlying type of a group.532 commits
13 commits
Agda
100.0%