dan
/
HITs-Examples
mirror of https://github.com/nmvdw/HITs-Examples
1
0
Fork 0
Code Issues Releases Wiki Activity
119 Commits 6 Branches 0 Tags 792 KiB
Commit Graph

23 Commits

Author SHA1 Message Date
Niels cb0af9a36a Added min function with proof of its specification 2017-08-09 15:11:14 +02:00
Niels 2bdec415d9 Improved notatio 2017-08-08 15:29:50 +02:00
Niels c1dfef3cc1 Separated lemmas for extensionality for properties, added tactic toHProp 2017-08-08 13:35:28 +02:00
Niels d9cde16f5a Added interface of finite stes 2017-08-07 12:20:43 +02:00
Niels f106be08de Added merely decidable equality => LEM 2017-08-03 23:01:57 +02:00
Niels 0bdf0b79fe Added k_finite in coq project 2017-08-03 13:54:02 +02:00
Niels 7d74b45fc3 Changed lattice 2017-08-03 12:21:34 +02:00
Dan Frumin 4141f9d456 Finalize the definition of K-finite (sub)objects 2017-08-02 14:14:14 +02:00
Niels 2ccece3225 Splitted cons_repr 2017-08-02 11:40:03 +02:00
Niels 0de37d6cea Split the development into different directories 2017-08-01 15:41:53 +02:00
Niels bae04a6d2b Lowercase enumerated 2017-08-01 15:20:17 +02:00
Niels fed9546d11 Some cleanup 2017-08-01 15:18:07 +02:00
Dan Frumin 37e3017cfc Basic properties of enumerated sets 2017-07-31 17:39:01 +02:00
Niels 8ff9089d3d Added disjunction. 2017-07-31 14:52:41 +02:00
Dan Frumin f4d89f810c 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
Niels 8c31e4d382 Lists implement finite sets 2017-06-20 13:54:42 +02:00
Dan Frumin a95ddea6ca FSet is a strong powerset monad 2017-06-20 11:34:09 +02:00
Dan Frumin 8e6ab4c340 Separate the extensionality proof 
and fix some tactics
 2017-06-19 21:06:17 +02:00
Niels 5f4c834cbe Proofs of the lattice properties (via extensionality) 2017-06-19 17:08:56 +02:00
Leon Gondelman 57d8ee9d55 cons representation of finite sets 2017-06-19 16:06:04 +02:00
Leon Gondelman 0d210cae04 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
Dan Frumin 826b6ba233 Port the FiniteSets library to HitTactics 2017-05-24 13:54:00 +02:00
Leon Gondelman 13737556c6 Setup for finite sets library. 2017-05-23 16:30:31 +02:00