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
6971697c09e6720b8943865d80673a4b0a5083a6
HITs-Examples/FiniteSets/_CoqProject
T
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

8 lines
114 B
Plaintext
Raw Blame History

-R . "" COQC = hoqc COQDEP = hoqdep
-R ../prelude ""
definition.v
operations.v
properties.v
empty_set.v
ordered.v
Reference in new issue View Git Blame Copy Permalink
Powered by Gitea Version: 28.2.0 Page: 734ms Template: 53ms
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