HITs-Examples/FiniteSets
Niels dfd590724b Simplified independence proof 2017-09-01 16:56:49 +02:00
..
fsets A cons-based induction principle for FSets 2017-08-19 18:56:33 +02:00
implementations Removed View_rec2 2017-08-17 17:18:57 +02:00
representations Shortened T.v 2017-09-01 16:29:48 +02:00
variations Shortened T.v 2017-09-01 16:29:48 +02:00
FSets.v Split the development into different directories 2017-08-01 15:41:53 +02:00
Sub.v Simplified independence proof 2017-09-01 16:56:49 +02:00
_CoqProject Move aux lemmas into the plumbing file 2017-08-24 16:50:11 +02:00
disjunction.v Simplified proof of extensionality 2017-08-14 16:39:20 +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 lattice hints 2017-08-18 11:18:37 +02:00
notation.v Completely fixed notation 2017-08-08 17:00:30 +02:00
ordered.v Added min function with proof of its specification 2017-08-09 15:11:14 +02:00
plumbing.v Move aux lemmas into the plumbing file 2017-08-24 16:50:11 +02:00