6 commits

Author	SHA1	Message	Date
Floris van Doorn	0ec525a8ee	feat(two_quotient): finish proof of elim_incl2	2015-08-07 13:34:40 -07:00
Floris van Doorn	7a780b1b60	feat(hott): various minor changes in the HoTT library	2015-08-04 13:01:11 +02:00
Leonardo de Moura	b3cd3efbb4	refactor(hott): fix "sorry"s at int/basic.hlean, and comment the remaining "sorry"s	2015-07-27 08:34:11 -07:00
Leonardo de Moura	584f9e3f49	fix(library/tactic/unfold_rec): support indexed families at unfold_rec ... This commit also removes many (now unnecessary) folds from the HoTT library. See issue #692 We still have to implement support for recursive definitions based on brec_on that recurse over inductive families.	2015-07-12 12:32:58 -04:00
Leonardo de Moura	4b1b3e277f	feat(frontends/lean): rename '[unfold-c]' to '[unfold]' and '[unfold-f]' to '[unfold-full]' ... see issue #693	2015-07-07 16:37:06 -07:00
Floris van Doorn	24762fe843	feat(hit): add hits with 2-path constructors ... In hit.two_quotient we define a general construction to define hits with 2-dimensional path constructors, similar to quotients. We can add 2-paths between any two 'words', where a word consists of 1-path constructors, concatenation and inverses. We use this to define the torus, reflexive quotients and the reduced suspension. There is still one 'sorry' in the construction	2015-06-25 22:31:41 -04:00