conal / felix
Agda category theory library for denotational design
☆50Updated 10 months ago
Alternatives and similar repositories for felix:
Users that are interested in felix are comparing it to the libraries listed below
- Interpret Haskell programs into any cartesian closed category.☆59Updated 3 months ago
- Paper and talk☆53Updated last year
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Eventually a practical 2-level TT-based compiler☆27Updated 3 weeks ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- ☆29Updated 2 years ago
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- Fast equality saturation in Haskell☆84Updated last month
- a talk about and sample project for the [Categorifier](https://github.org/con-kitty/categorifier) GHC plugin.☆19Updated last year
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- A verified compiler for a lazy functional language☆35Updated 2 weeks ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- ☆30Updated 6 years ago
- Linear Types, Symmetric Monoidal Categories, and Tensors☆11Updated last year
- Parser Combinator Library for Lean 4☆47Updated 2 weeks ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 7 months ago
- Ground Zero: Lean 4 HoTT Library☆57Updated last week
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 7 months ago
- ☆29Updated 2 years ago
- Haskell library for doing category theory with a central role for profunctors☆21Updated 2 weeks ago
- Distributors - Unifying Parsers, Printers & Grammars☆21Updated last week
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆35Updated last year
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆61Updated 6 months ago
- A Galilean revolution for computing: Unboundedly scalable reliability and efficiency☆14Updated last year
- Formal Topology in Univalent Foundations (WIP).☆36Updated 2 years ago
- ☆47Updated 4 months ago
- NbE course @ Chalmers☆28Updated 6 months ago