SkySkimmer / HoTTClassesLinks
HoTT proofs using experimental induction-induction (mostly about real numbers) (used to contain the HoTT.Classes proofs)
☆15Updated 4 years ago
Alternatives and similar repositories for HoTTClasses
Users that are interested in HoTTClasses are comparing it to the libraries listed below
Sorting:
- Formal topology (and some probability) in Coq☆32Updated 6 years ago
- Work in progress☆38Updated 4 months ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆15Updated 8 years ago
- Directed type theory for formal category theory☆17Updated 8 years ago
- A hip inductive theorem prover!☆90Updated 3 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- Mtac in Agda☆28Updated 4 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 8 years ago
- Agda-style equational reasoning in Haskell☆54Updated 6 months ago
- Implementation of Nuprl's type theory in Coq☆46Updated 10 months ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Formalizing nbe in agda☆32Updated 12 years ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 4 months ago
- Formalising Type Theory in a modular way for translations between type theories☆95Updated 7 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 11 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 3 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Updated 8 years ago
- Relative Monad Library for Agda☆24Updated 6 years ago
- topos programming☆31Updated 7 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 4 months ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Updated 3 years ago