A formalization of category theory in the Coq proof assistant.
☆100Nov 4, 2024Updated last year
Alternatives and similar repositories for Categories
Users that are interested in Categories are comparing it to the libraries listed below
Sorting:
- A framework for extensible, reflective decision procedures.☆19Nov 25, 2019Updated 6 years ago
- Formal topology (and some probability) in Coq☆31Nov 30, 2018Updated 7 years ago
- Agda code for experimenting with internal models of cubical type theory☆15Apr 3, 2018Updated 7 years ago
- ☆10May 3, 2017Updated 8 years ago
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 10 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Jul 9, 2018Updated 7 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆33Jun 5, 2019Updated 6 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45May 14, 2016Updated 9 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- System F in coq.☆19Jan 27, 2015Updated 11 years ago
- Reflection library for Coq☆12Sep 26, 2019Updated 6 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- ☆12Jan 25, 2022Updated 4 years ago
- Type theory + whales and syntax☆11Nov 28, 2019Updated 6 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- Directed type theory for formal category theory☆17Apr 7, 2017Updated 8 years ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- Implementation of Nuprl's type theory in Coq☆46Feb 25, 2026Updated last week
- Abstract binding tree code generator☆37Oct 31, 2016Updated 9 years ago
- The Coq Effective Algebra Library [maintainers=@CohenCyril,@proux01]☆74Updated this week
- Robots powered by Constructive Reals☆34Nov 3, 2017Updated 8 years ago
- secret project☆17Mar 14, 2018Updated 7 years ago
- ☆11Jul 8, 2020Updated 5 years ago
- A formalization of Constructive Projective Geometry in Agda☆12Jun 10, 2019Updated 6 years ago
- ☆28Jun 18, 2020Updated 5 years ago
- Finite sets, finite maps, multisets and generic sets☆51Feb 28, 2026Updated last week
- Type safe abstract binding trees for Haskell, using Vinyl☆16Oct 1, 2017Updated 8 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Oct 9, 2018Updated 7 years ago
- Notes on how to use the internal language of toposes in algebraic geometry☆60Feb 13, 2026Updated 3 weeks ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Aug 5, 2016Updated 9 years ago
- Combinatorial species in HoTT☆12May 23, 2015Updated 10 years ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Apr 29, 2023Updated 2 years ago
- The original Edinburgh LCF.☆34Oct 21, 2016Updated 9 years ago
- A library for formalizing Haskell types and functions in Coq☆171Oct 15, 2023Updated 2 years ago