vladimirias / FoundationsLinks
Voevodsky's original development of the univalent foundations of mathematics in Coq
☆57Updated 11 years ago
Alternatives and similar repositories for Foundations
Users that are interested in Foundations are comparing it to the libraries listed below
Sorting:
- The mathematical study of type theories, in univalent foundations☆117Updated 8 months ago
- Homotopy theory in Coq.☆89Updated 14 years ago
- HoTT in Lean 3☆82Updated 5 years ago
- Lean theorem prover version 0.2 (it supports standard and HoTT modes)☆123Updated 3 years ago
- Schemes in Lean (v2)☆44Updated 5 years ago
- An experimental category theory library for Lean☆50Updated 2 years ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆213Updated 3 years ago
- Lecture notes on univalent foundations of mathematics with Agda☆231Updated last year
- An Open Encyclopedia of Proof Systems☆119Updated 3 years ago
- Selected Papers of Dana S. Scott☆168Updated last year
- ☆92Updated 6 months ago
- Coq Repository at Nijmegen [maintainers=@spitters,@VincentSe,@Lysxia]☆115Updated last month
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆53Updated this week
- Categorical logic from a categorical point of view☆81Updated 2 years ago
- ☆84Updated 8 years ago
- Mathematical Components (the Book)☆148Updated last month
- A formalization of M-types in Agda☆36Updated 5 years ago
- Implementation of Univalence in Cubical Sets☆147Updated 10 years ago
- General-Purpose Computer Algebra System as an EDSL in Haskell☆95Updated last year
- Notes on how to use the internal language of toposes in algebraic geometry☆60Updated last month
- Real number computation software☆128Updated 3 years ago
- A library of abstract interfaces for mathematical structures in Coq [maintainer=@spitters,@Lysxia]☆166Updated last month
- A DSL for the internal language of a topos☆66Updated 3 months ago
- A formal proof of the independence of the continuum hypothesis☆136Updated last year
- A library of mechanised undecidability proofs in the Coq proof assistant.☆124Updated last month
- ☆27Updated last year
- The MMT Language and System☆76Updated 2 months ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆71Updated last year
- A Rocq formalization of information theory and linear error-correcting codes☆71Updated last week
- ☆48Updated 2 years ago