kangxyz / cubical-classicsLinks
An attempt towards univalent classical mathematics in Cubical Agda.
☆32Updated 2 years ago
Alternatives and similar repositories for cubical-classics
Users that are interested in cubical-classics are comparing it to the libraries listed below
Sorting:
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- ☆36Updated 4 years ago
- A formalization of the theory behind the mugen library☆19Updated last year
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- Experiments with higher-order abstract syntax in Agda☆22Updated 3 years ago
- Extensions to cubical for categorical logic/type theory☆32Updated this week
- An implementation of a simple Neural network in Idris using category theory.☆23Updated last year
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- my phd thesis☆26Updated last year
- ☆17Updated last year
- Mechanizations of Type Theories☆32Updated 2 months ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Experimental implementation of a Cubical Type Theory modeled by presheaves over posets☆12Updated last year
- Revised Omega-categorical Typechecker☆27Updated 11 months ago
- HoTT Book formalisations in Rzk.☆19Updated last year
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- antifunext☆34Updated last year
- Organize mathematical thoughts☆20Updated 2 years ago
- ♾️ A library for universe levels and universe polymorphism☆35Updated 2 months ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 5 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- ☆16Updated 3 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆19Updated 4 years ago
- ☆17Updated last year
- ☆25Updated last year