peterlefanulumsdaine / Oberwolfach-explorationsLinks
collaboration on work in progress
☆15Updated 14 years ago
Alternatives and similar repositories for Oberwolfach-explorations
Users that are interested in Oberwolfach-explorations are comparing it to the libraries listed below
Sorting:
- Cohesive type theory☆19Updated 3 years ago
- Algebraic Combinatorics in Coq☆38Updated 4 months ago
- A formalization of M-types in Agda☆32Updated 5 years ago
- HoTT in Lean 3☆80Updated 4 years ago
- Directed type theory for formal category theory☆17Updated 8 years ago
- Type theory in type theory☆16Updated 13 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- Schemes in Lean (v2)☆43Updated 4 years ago
- An enhanced unification algorithm for Coq☆56Updated last month
- Formal topology (and some probability) in Coq☆32Updated 6 years ago
- An equational theorem prover based on Knuth-Bendix completion☆50Updated 2 months ago
- A formalization of synthetic algebraic geometry in Agda☆14Updated 6 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45Updated 9 years ago
- A (formalised) general definition of type theories☆57Updated 3 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- HoTT group project to TeXify Cartmell's PhD thesis “Generalised Algebraic Theories and Contextual Categories”☆15Updated 2 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 6 months ago
- Synthetic geometry. Probably mostly algebraic geometry.☆24Updated last year
- Homotopy theory in Coq.☆91Updated 14 years ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Updated 2 years ago
- Datatypes as quotients of polynomial functors☆35Updated 5 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- Synthetic Topology in Homotopy Type Theory for probabilstic programming☆12Updated 7 years ago
- Research material of Erik Palmgren (1963–2019)☆20Updated last month
- H.O.T.T. using rewriting in Agda☆42Updated 2 years ago
- Generates natural language versions of Coq proofs☆51Updated 7 years ago
- ☆84Updated 7 years ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆17Updated 4 years ago
- ☆29Updated 2 years ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago