HITs-Examples/FiniteSets
Niels 92bc50d79f Improved notation to unicode 2017-08-08 15:30:12 +02:00
..
fsets Improved notatio 2017-08-08 15:29:50 +02:00
implementations Improved notatio 2017-08-08 15:29:50 +02:00
representations Improved notatio 2017-08-08 15:29:50 +02:00
variations Correspondence between enumerated subobjects and k-finite subobjects 2017-08-03 23:22:36 +02:00
FSets.v Split the development into different directories 2017-08-01 15:41:53 +02:00
Sub.v Added merely decidable equality => LEM 2017-08-03 23:01:57 +02:00
_CoqProject Improved notatio 2017-08-08 15:29:50 +02:00
disjunction.v Improved notatio 2017-08-08 15:29:50 +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 Improved notatio 2017-08-08 15:29:50 +02:00
notation.v Improved notation to unicode 2017-08-08 15:30:12 +02:00
ordered.v Comment out the long min fn 2017-06-14 13:08:41 +02:00