srcreigh / aluffi
Solutions to Paolo Aluffi's "Algebra: Chapter 0".
☆57Updated 7 years ago
Alternatives and similar repositories for aluffi:
Users that are interested in aluffi are comparing it to the libraries listed below
- Categorical logic from a categorical point of view☆77Updated last year
- An experimental category theory library for Lean☆49Updated last year
- Formalising Type Theory in a modular way for translations between type theories☆91Updated 7 years ago
- Mathematical Components (the Book)☆141Updated last year
- What I wish I knew when learning HoTT☆53Updated 6 years ago
- Implementation of Univalence in Cubical Sets☆144Updated 9 years ago
- A language based on homotopy type theory with an interval☆85Updated 9 years ago
- Coq Repository at Nijmegen [maintainers=@spitters,@VincentSe,@Lysxia]☆114Updated 2 months ago
- EPIT 2020 - Spring School on Homotopy Type Theory☆104Updated 3 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- Library of the ##dependent distributed research support group☆112Updated 8 months ago
- Agda formalisation of the Introduction to Homotopy Type Theory☆124Updated 3 years ago
- A hip inductive theorem prover!☆89Updated 3 years ago
- A library for formalizing Haskell types and functions in Coq☆168Updated last year
- Homotopy theory in Coq.☆92Updated 14 years ago
- HoTT in Lean 3☆78Updated 4 years ago
- 15-819 (Homotopy Type Theory) Lecture Notes☆53Updated 4 years ago
- Agda bindings to SMT-LIB2 compatible solvers.☆96Updated 5 months ago
- Notes on how to use the internal language of toposes in algebraic geometry☆55Updated last month
- A monad for interfacing with external SAT solvers☆64Updated 3 weeks ago
- ☆17Updated last year
- Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality☆53Updated 2 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆101Updated 2 years ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆61Updated 5 months ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆83Updated 4 years ago
- ☆84Updated 7 years ago
- This project contains various supporting libraries for lean to reason about protocols.☆43Updated 7 years ago
- constructive abstract algebra☆103Updated 5 years ago
- Dependently Typed Metaprogramming Exercises☆23Updated 7 years ago
- Reference type checker for the Lean theorem prover☆61Updated 8 years ago