HITs-Examples/FiniteSets/_CoqProject

-R . "" COQC = hoqc COQDEP = hoqdep
-R ../prelude ""
definition.v
disjunction.v
operations.v
Ext.v
properties.v
empty_set.v
ordered.v
cons_repr.v
Lattice.v
monad.v
Lists.v
bad.v
Enumerated.v
Setup for finite sets library. 2017-05-23 16:30:31 +02:00			`-R . "" COQC = hoqc COQDEP = hoqdep`
Port the FiniteSets library to HitTactics 2017-05-24 13:54:00 +02:00			`-R ../prelude ""`
Setup for finite sets library. 2017-05-23 16:30:31 +02:00			`definition.v`
Added disjunction. 2017-07-31 14:52:41 +02:00			`disjunction.v`
Setup for finite sets library. 2017-05-23 16:30:31 +02:00			`operations.v`
Separate the extensionality proof and fix some tactics 2017-06-19 21:06:17 +02:00			`Ext.v`
Setup for finite sets library. 2017-05-23 16:30:31 +02:00			`properties.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`
			`ordered.v`
cons representation of finite sets 2017-06-19 16:06:04 +02:00			`cons_repr.v`
Separate the extensionality proof and fix some tactics 2017-06-19 21:06:17 +02:00			`Lattice.v`
FSet is a strong powerset monad 2017-06-20 11:33:13 +02:00			`monad.v`
Lists implement finite sets 2017-06-20 13:54:42 +02:00			`Lists.v`
Proof that the trunctation is really needed If there is no 0-truncation then the resulting type is not an h-set. 2017-06-21 14:10:59 +02:00			`bad.v`
Basic properties of enumerated sets 2017-07-31 17:39:01 +02:00			`Enumerated.v`