https://github.com/pyzh/cubical
Groupoid Infinity cubical base library for cubicaltt
https://github.com/pyzh/cubical
Last synced: 4 months ago
JSON representation
Groupoid Infinity cubical base library for cubicaltt
- Host: GitHub
- URL: https://github.com/pyzh/cubical
- Owner: pyzh
- Created: 2019-01-08T15:18:24.000Z (over 7 years ago)
- Default Branch: master
- Last Pushed: 2019-01-03T14:31:34.000Z (over 7 years ago)
- Last Synced: 2025-03-15T11:12:02.241Z (over 1 year ago)
- Homepage: https://groupoid.space/mltt/types/
- Size: 168 KB
- Stars: 0
- Watchers: 2
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
[](https://travis-ci.org/groupoid/cubical)
Groupoid Infinity
=================
The Groupoid Infinity Cubical Base Library is dedicated to [cubical](https://github.com/mortberg/cubicaltt)-compatible
typecheckers based on homotopy interval [0,1] and MLTT as a core. The base library is founded
on top of 5 core modules: proto (composition, id, const), path (subst, trans, cong, refl, singl, sym),
propset (isContr, isProp, isSet), equiv (fiber, eqiuv) and iso (lemIso, isoPath).
This machinery is enough to prove univalence axiom.
(i) The library has rich recursion scheme primitives in lambek module, while very basic nat, list, stream
functionality. (ii) The very basic theorems are given in pi, iso_pi, sigma, iso_sigma, retract modules.
(iii) The library has category theory theorems from HoTT book in cat, fun and category modules.
(iv) The library also includes some impredicative categorical encoding sketches in coproduct_set.
lambek also includes inductive semantics modeled with cata/ana recursion and fixpoint adjoints in/out.
This library is best to read with HoTT book at http://groupoid.space/mltt/types/

* [bool](http://groupoid.space/mltt/types/#bool) — Boolean
* [control](http://groupoid.space/mltt/types/#control) — Control Free/CoFree, fix, pure/applicative typeclasses)
* [eq](http://groupoid.space/mltt/types/#eq) — Runtime equality typeclass
* [functor](http://groupoid.space/mltt/types/#functor) — Runtime Functor typeclass
* [either](http://groupoid.space/mltt/types/#either) — Runtime Either
* [maybe](http://groupoid.space/mltt/types/#either) — Runtime Maybe
* [nat](http://groupoid.space/mltt/types/#nat) — Runtime Nat
* [list](http://groupoid.space/mltt/types/#list) — Runtime List
* [stream](http://groupoid.space/mltt/types/#stream) — Runtime Stream
* [vector](http://groupoid.space/mltt/types/#vector) — Runtime Vector
* [function](http://groupoid.space/mltt/types/#function) — Runtime Function
* [equiv](http://groupoid.space/mltt/types/#equiv) — Core Equivalence
* [propset](http://groupoid.space/mltt/types/#propset) — Core isContr isProp isSet isGroupoid
* [path](http://groupoid.space/mltt/types/#path) — Core Path Type
* [proto](http://groupoid.space/mltt/types/#proto) — Core Proto File
* [iso](http://groupoid.space/mltt/iso) — Core Iso
* [iso_pi](http://groupoid.space/mltt/iso.pi) — Iso Pi Theorems
* [iso_sigma](http://groupoid.space/mltt/iso.sigma) — Iso Sigma Theorems
* [pi](http://groupoid.space/mltt/types/#pi) — Pi
* [sigma](http://groupoid.space/mltt/types/#pi) — Sigma
* [lambek](http://groupoid.space/mltt/iso.sigma) — Inductive Models
* [cat](http://groupoid.space/mltt/types/#cat) — HoTT Category
* [univ](http://groupoid.space/mltt/univ) — HoTT Univalence
* [circle](http://groupoid.space/mltt/types/#circle) — HoTT Circle
* [retract](http://groupoid.space/mltt/types/#retract) — HoTT Retract
* [fun](http://groupoid.space/mltt/types/#fun) — HoTT Categorical Functor
Author
------
* Maxim Sokhatsky
Credits
-------
* Eugene Smolanka
* Andy Melnikov
* Denis Stoyanov
* Dmitry Astapov