dan/HITs-Examples

mirror of https://github.com/nmvdw/HITs-Examples synced 2025-11-03 07:03:51 +01:00

Go to file

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

Added Agda code for some HITs

2017-05-22 16:46:58 +02:00

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

Port the FiniteSets library to HitTactics

2017-05-24 13:54:00 +02:00

_CoqProject

Add a general hit recursion tactic.

2017-05-18 17:43:19 +02:00

.gitignore

Better gitignore

2017-05-22 16:45:51 +02:00

Expressions.v

Expressions

2017-05-01 17:27:49 +02:00

FinSets.v

Switch to the DecidablePaths typeclass

2017-05-23 12:12:22 +02:00

FSet.v

Added idempotency of the intersection

2017-05-23 21:31:45 +02:00

Integers.v

added proof that two reps of Z are iso (if everything set)

2017-01-10 23:46:50 +01:00

Mod2.v

Replace the canonical structures mechanism for recursion with type classes

2017-05-22 21:06:13 +02:00

README.md

Update the README

2017-05-18 17:46:00 +02:00

README.md

HITs-Coq

Needed: https://github.com/HoTT/HoTT

More information on the work is in HITs.pdf.

Building

Make sure that you have hoqc installed. Then generate the Makefile and build the project:

coq_makefile -f _CoqProject -o Makefile
make