Dan Frumin 53e38f0238 Try out HoTTClasses		2017-08-02 17:08:40 +02:00
..
fsets	Fix compilation	2017-08-02 15:45:12 +02:00
implementations	Splitted cons_repr	2017-08-02 11:40:03 +02:00
representations	Splitted cons_repr	2017-08-02 11:40:03 +02:00
variations	Finalize the definition of K-finite (sub)objects	2017-08-02 14:14:14 +02:00
FSets.v	Split the development into different directories	2017-08-01 15:41:53 +02:00
_CoqProject	Try out HoTTClasses	2017-08-02 17:08:40 +02:00
classes.v	Try out HoTTClasses	2017-08-02 17:08:40 +02:00
disjunction.v	Fix compilation	2017-08-02 15:45:12 +02:00
empty_set.v	first step toward cons-union iso: construction of min function for FSet A, where A is Totally Ordered. To construct min, various lemmas about empty set are needed. This min function is constructed in a very inefficient way w.r.t. proofs of assoc, comm, etc.	2017-06-03 00:08:12 +02:00
lattice.v	Added lattice constructions	2017-08-02 14:21:12 +02:00
ordered.v	Comment out the long min fn	2017-06-14 13:08:41 +02:00