SkySkimmer / HoTTClasses
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
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Mtac in Agda☆28Updated 4 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆14Updated 8 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 5 months ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Directed type theory for formal category theory☆17Updated 8 years ago
- A fast implementation of real numbers in Haskell☆10Updated 6 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 5 months ago
- Work in progress☆34Updated 5 months ago
- Formalizing nbe in agda☆30Updated 12 years ago
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- Agda-style equational reasoning in Haskell☆53Updated last month
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- Synthetic Differential Geometry in Agda☆12Updated 10 years ago
- ☆23Updated 10 months ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Formal topology (and some probability) in Coq☆32Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Cohesive type theory☆19Updated 3 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 6 years ago
- Research material of Erik Palmgren (1963–2019)☆20Updated 3 weeks ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago