sto0pkid / CategoryTheory
Category Theory in Agda
☆13Updated 7 years ago
Alternatives and similar repositories for CategoryTheory:
Users that are interested in CategoryTheory are comparing it to the libraries listed below
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- being my notes and exercises for the Types Summer School in Ohrid, (FYRO) Macedonia, July 2017☆9Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- being the programs and code for a paper about general recursion☆24Updated 10 years ago
- Haskell version of the code from "Handbook of Practical Logic and Automated Reasoning"☆16Updated 10 months ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- ☆12Updated 5 years ago
- Constructive definition of real numbers implemented in agda.☆10Updated 8 years ago
- Functional Programing in Scala (in Idris) [Idris]☆16Updated 9 years ago
- Combinatorial species in HoTT☆12Updated 9 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- Implementation of dependent type theory in SWI-Prolog☆8Updated 4 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆23Updated 2 months ago
- Directed type theory for formal category theory☆17Updated 7 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆14Updated 7 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- An Agda formalisation of the theory of directed containers☆11Updated 13 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 4 months ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 7 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Updated 6 years ago
- Formalizing nbe in agda☆30Updated 12 years ago
- A playground for type theory implementations in Racket☆20Updated 9 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆33Updated 7 years ago
- ☆22Updated 8 years ago