Logo
Explore Help
Sign In
dan/HITs-Examples
Watch 1
Star 0 Fork 0
mirror of https://github.com/nmvdw/HITs-Examples synced 2026-09-18 08:10:23 +02:00
Code Issues Releases Wiki Activity
Files
efec2e88f8fc764276b24e8a1e1c31aca99d9cdc
HITs-Examples/FiniteSets
T
History
niels 6a3965dfa7 Merge branch 'classes' of https://github.com/nmvdw/HITs-Examples into classes
2017-08-04 14:52:56 +02:00
..
fsets
Correspondence between enumerated subobjects and k-finite subobjects
2017-08-03 23:22:36 +02:00
implementations
Splitted cons_repr
2017-08-02 11:40:03 +02:00
representations
Remove a useless vernacular command
2017-08-03 23:25:25 +02:00
variations
Correspondence between enumerated subobjects and k-finite subobjects
2017-08-03 23:22:36 +02:00
_CoqProject
Merge branch 'classes' of https://github.com/nmvdw/HITs-Examples into classes
2017-08-04 14:52:56 +02:00
classes.v
Try out HoTTClasses
2017-08-02 17:08:40 +02:00
disjunction.v
Merge branch 'master' of https://github.com/nmvdw/HITs-Examples
2017-08-03 12:24:39 +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
FSets.v
Split the development into different directories
2017-08-01 15:41:53 +02:00
lattice.v
Fix the implicit arguments for lattice operations
2017-08-03 17:09:10 +02:00
ordered.v
Comment out the long min fn
2017-06-14 13:08:41 +02:00
Sub.v
Added merely decidable equality => LEM
2017-08-03 23:01:57 +02:00
Powered by Gitea Version: 28.2.0 Page: 56ms Template: 5ms
Auto
English
Bahasa Indonesia Deutsch English Español Français Gaeilge Italiano Latviešu Magyar nyelv Nederlands Polski Português de Portugal Português do Brasil Suomi Svenska Türkçe Čeština Ελληνικά Български Русский Українська فارسی മലയാളം 日本語 简体中文 繁體中文(台灣) 繁體中文(香港) 한국어
Licenses API