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

116 Commits

Author SHA1 Message Date
Niels 30004e1c8b Added membership of product 2017-08-07 23:15:25 +02:00
Niels e498b93f16 Added product 2017-08-07 22:13:42 +02:00
Niels 8c10ab1c0c More cleaning 2017-08-07 16:57:21 +02:00
Niels 1e373364b2 Some cleaning in notation 2017-08-07 16:49:46 +02:00
Niels 1bab2206a3 Some cleaning 2017-08-07 16:22:55 +02:00
Niels a0844f6be4 Some simplifications in proofs, extra proofs for implementation 2017-08-07 15:39:01 +02:00
Niels d5585f32c6 Added basis for reflection in interface 2017-08-07 14:55:07 +02:00
Niels d9cde16f5a Added interface of finite stes 2017-08-07 12:20:43 +02:00
Dan Frumin 6f016d1b7f Remove a useless vernacular command 2017-08-03 23:25:25 +02:00
Dan Frumin 90d795b708 Correspondence between enumerated subobjects and k-finite subobjects 2017-08-03 23:22:36 +02:00
Niels f106be08de Added merely decidable equality => LEM 2017-08-03 23:01:57 +02:00
Dan Frumin 6d3d0eda9f Construct a mapping from [FSet] to enumerated subobjects 2017-08-03 18:06:39 +02:00
Dan Frumin 69b4b6d7a5 Fix the implicit arguments for lattice operations 2017-08-03 17:09:10 +02:00
Dan Frumin 72ce66f833 Make [enumerated A] an hProp & show that Kf => enumerated 2017-08-03 17:00:02 +02:00
Dan Frumin c7e12d6d25 Enumerated implies Kurarowski-finite 2017-08-03 15:16:47 +02:00
Dan Frumin 31889d4e48 A short lemma [FSet A = FSetC A] 2017-08-03 15:10:45 +02:00
Niels 9cdfc671dc Added structure to k_finite sts 2017-08-03 15:07:53 +02:00
Niels 0bdf0b79fe Added k_finite in coq project 2017-08-03 13:54:02 +02:00
Dan Frumin efce779b06 Simplify some proofs and barely improve the compilation time 2017-08-03 12:49:15 +02:00
Niels 241f5ea377 Added subobjects 2017-08-03 12:27:43 +02:00
Niels fec00177ad Merge branch 'master' of https://github.com/nmvdw/HITs-Examples 2017-08-03 12:24:39 +02:00
Niels 7d74b45fc3 Changed lattice 2017-08-03 12:21:34 +02:00
Dan Frumin 8a65852d1b Fix compilation 2017-08-02 15:45:12 +02:00
Niels 77a449e68b Added lattice constructions 2017-08-02 14:21:12 +02:00
Dan Frumin 4141f9d456 Finalize the definition of K-finite (sub)objects 2017-08-02 14:14:14 +02:00
Niels fa076f5f41 k-finiteness 2017-08-02 13:30:25 +02:00
Niels 2ccece3225 Splitted cons_repr 2017-08-02 11:40:03 +02:00
Niels 5ee7053631 Removed bad hints 2017-08-01 17:35:23 +02:00
Niels e6bf0f9d5d Fixed NeutralL and NeutralR 2017-08-01 17:25:57 +02:00
Niels b3b3e5b6c2 HProp is a lattice 2017-08-01 17:12:32 +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 1eec9628ce Lowercase files 2017-08-01 15:18:07 +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 b06c59339b Small fix 2017-07-31 14:54:20 +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
Dan Frumin ab48ab4a75 Decidable equality on FSets 2017-06-21 11:22:56 +02:00
Dan Frumin 1a3bb2cb5a Use the [Functorish] instance from the HoTT library 2017-06-21 11:07:22 +02:00
Niels 3274bed4e0 Lists and finite sets 2017-06-20 17:33:35 +02:00
Niels c8a84349b1 Further work on lists (simple implementation) 2017-06-20 15:08:52 +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 47a38b3568 Separate the lattice properties proofs, get rid of the admits and general cleanup 2017-06-19 21:32:55 +02:00
Dan Frumin 8e6ab4c340 Separate the extensionality proof 
and fix some tactics
 2017-06-19 21:06:17 +02:00
Niels 229df7b270 Shortened proofs 2017-06-19 17:54:44 +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
Dan Frumin 490980db0f Some cleanup for the extensionality proof 2017-06-19 12:24:57 +02:00
Dan Frumin dce70f517f Minor cleanup of some proofs 2017-06-16 13:24:54 +02:00
Dan Frumin 6971697c09 Add the difference operation 2017-06-14 18:06:16 +02:00
Dan Frumin 036d1599b2 Merge branch 'bloop' 2017-06-14 13:09:52 +02:00
Dan Frumin abec9ecd00 Comment out the long min fn 2017-06-14 13:08:41 +02:00
Dan Frumin a1a6912cb2 Use equiv_iff_hprop_curried from HoTT 2017-06-14 13:00:20 +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
Leon Gondelman f8ed41e5fe trailing white spaces 2017-05-26 12:28:07 +02:00
Leon Gondelman 140b02e9f4 subset 2017-05-24 18:28:24 +02:00
Dan Frumin 826b6ba233 Port the FiniteSets library to HitTactics 2017-05-24 13:54:00 +02:00
Niels 6ffbbb440f More absorbtion 2017-05-24 12:10:39 +02:00
Niels 565fecec30 Changed names, further work on distributive laws 2017-05-24 11:47:30 +02:00
Niels e63f1b8bf5 One absorption law 2017-05-23 23:24:22 +02:00
Niels 2f7840c494 Associativity of intersection. 2017-05-23 22:58:35 +02:00
Niels 0bdbcdfc6c Recursion rule is now defined via induction. 2017-05-23 21:50:26 +02:00
Niels 6bb5e8b690 Added idempotency of the intersection 2017-05-23 21:31:45 +02:00
Leon Gondelman 13737556c6 Setup for finite sets library. 2017-05-23 16:30:31 +02:00