Niels 3274bed4e0 Lists and finite sets		2017-06-20 17:33:35 +02:00
..
Ext.v	Separate the extensionality proof	2017-06-19 21:06:17 +02:00
Lattice.v	Separate the lattice properties proofs, get rid of the admits and general cleanup	2017-06-19 21:32:55 +02:00
Lists.v	Lists and finite sets	2017-06-20 17:33:35 +02:00
_CoqProject	Lists implement finite sets	2017-06-20 13:54:42 +02:00
cons_repr.v	cons representation of finite sets	2017-06-19 16:06:04 +02:00
definition.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
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
monad.v	FSet is a strong powerset monad	2017-06-20 11:34:09 +02:00
operations.v	Add the difference operation	2017-06-14 18:06:16 +02:00
ordered.v	Comment out the long min fn	2017-06-14 13:08:41 +02:00
properties.v	Further work on lists (simple implementation)	2017-06-20 15:08:52 +02:00