Floris van Doorn 18ec5f8b85 feat(categories): prove introduction rule for equivalences		2015-11-08 14:04:58 -08:00
..
comma.hlean	refactor(hott): fix "sorry"s at int/basic.hlean, and comment the remaining "sorry"s	2015-07-27 08:34:11 -07:00
cone.hlean	feat(category.limits): prove that being complete is a mere proposition for categories	2015-09-28 09:09:22 -07:00
constructions.md	feat(category.functor2): prove that the category of functors is complete and cocomplete if the codomain is	2015-11-08 14:04:58 -08:00
default.hlean	refactor(hott/*): remove 'Module:' lines	2015-05-23 20:52:58 +10:00
discrete.hlean	fix(hott,frontends/lean,library,library/tactic): make sure we can still compile the HoTT library	2015-11-08 14:04:55 -08:00
finite_cats.hlean	feat(category): define colimits as dual of limits	2015-09-28 09:09:22 -07:00
functor.hlean	feat(categories): prove introduction rule for equivalences	2015-11-08 14:04:58 -08:00
functor2.hlean	feat(category.functor2): prove that the category of functors is complete and cocomplete if the codomain is	2015-11-08 14:04:58 -08:00
hset.hlean	feat(category.functor2): prove that the category of functors is complete and cocomplete if the codomain is	2015-11-08 14:04:58 -08:00
indiscrete.hlean	feat(category): define terminal, initial, indiscrete and sum category	2015-09-28 09:09:21 -07:00
initial.hlean	feat(category.functor2): prove that the category of functors is complete and cocomplete if the codomain is	2015-11-08 14:04:58 -08:00
opposite.hlean	feat(category.functor2): prove that the category of functors is complete and cocomplete if the codomain is	2015-11-08 14:04:58 -08:00
product.hlean	feat(category): start with the introduction rule for equivalences	2015-11-08 14:04:58 -08:00
sum.hlean	feat(category): start with the introduction rule for equivalences	2015-11-08 14:04:58 -08:00
terminal.hlean	feat(category): define terminal, initial, indiscrete and sum category	2015-09-28 09:09:21 -07:00