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
efce779b06a708e44f49889320134b3259c2c2d4
HITs-Examples/FiniteSets
T
History
dan efce779b06 Simplify some proofs and barely improve the compilation time
2017-08-03 12:49:15 +02:00
..
fsets
Simplify some proofs and barely improve the compilation time
2017-08-03 12:49:15 +02:00
implementations
Splitted cons_repr
2017-08-02 11:40:03 +02:00
representations
Splitted cons_repr
2017-08-02 11:40:03 +02:00
variations
Finalize the definition of K-finite (sub)objects
2017-08-02 14:14:14 +02:00
_CoqProject
Changed lattice
2017-08-03 12:21:34 +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
Changed lattice
2017-08-03 12:21:34 +02:00
ordered.v
Comment out the long min fn
2017-06-14 13:08:41 +02:00
Sub.v
Added subobjects
2017-08-03 12:27:43 +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