CategoricalData / catdb
Category theory in Coq, by Jason Gross
☆12Updated 9 years ago
Related projects ⓘ
Alternatives and complementary repositories for catdb
- A category theory library built on top of Homotopy Type Theory, by Jason Gross☆24Updated 10 years ago
- BibTeX database management in Idris☆18Updated 10 years ago
- Combinatorial species in HoTT☆12Updated 9 years ago
- Operad Programming Language in Haskell, by David Darais☆31Updated 10 years ago
- A small bifunctor library for idris☆21Updated 3 years ago
- Explorations in relations and the algebra of programming☆17Updated 5 years ago
- being the programs and code for a paper about general recursion☆24Updated 9 years ago
- A type theory based theorem proving library☆25Updated 13 years ago
- ☆23Updated 7 years ago
- FFI-based byte buffers for Idris☆11Updated 5 years ago
- Functional Programing in Scala (in Idris) [Idris]☆16Updated 9 years ago
- TODO☆10Updated 9 years ago
- A collection of proofs for some idris class instances - NOT MAINTAINED☆18Updated 9 years ago
- A small profunctor library for idris☆16Updated 2 years ago
- Fine-grained lattice primitives for Haskell☆18Updated 6 years ago
- ☆10Updated 5 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆22Updated 4 years ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 4 years ago
- Source files used for the Cedille Cast videos☆12Updated 4 years ago
- Bindings to Haskell's IO monad which respect Agda's semantics☆24Updated 6 years ago
- The Java Symbolic Simulator, part of SAW.☆10Updated 4 years ago
- A playground for type theory implementations in Racket☆20Updated 8 years ago
- ☆16Updated 6 years ago
- Category Theory in Agda☆12Updated 6 years ago
- "Fail Fast" process management for Haskell; inspired by Erlang☆16Updated 7 years ago
- Provides a type-safe way of working with permutations in Idris☆34Updated 3 years ago
- My undergradate thesis on coinductive types in univalent type theory☆17Updated 6 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago