conal / felixLinks
Agda category theory library for denotational design
☆57Updated 2 weeks ago
Alternatives and similar repositories for felix
Users that are interested in felix are comparing it to the libraries listed below
Sorting:
- Interpret Haskell programs into any cartesian closed category.☆69Updated this week
- Eventually a practical 2-level TT-based compiler☆31Updated last week
- Basics of the dependently-typed functional language Agda ^_^☆41Updated 4 years ago
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- Formal Topology in Univalent Foundations (WIP).☆36Updated 3 years ago
- Paper and talk☆55Updated 2 years ago
- ☆52Updated 5 months ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 4 months ago
- Linear Types, Symmetric Monoidal Categories, and Tensors☆13Updated 3 months ago
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆73Updated last week
- CS410 "Advanced Functional Programming"☆30Updated last week
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- a talk about and sample project for the [Categorifier](https://github.org/con-kitty/categorifier) GHC plugin.☆21Updated last year
- Effective Algebraic Topology in Haskell☆91Updated last year
- Quantitative Type Theory implementation☆54Updated 4 years ago
- Agda lecture notes for the Functional Programming course at TU Delft☆132Updated 6 months ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 months ago
- Ground Zero: Lean 4 HoTT Library☆79Updated 2 weeks ago
- A non-interactive proof assistant using the Haskell type system☆38Updated 5 years ago
- Datatypes as quotients of polynomial functors☆41Updated 5 years ago
- being a particular fragment of Haskell, extended to a proof system☆43Updated 2 months ago
- A tutorial on how Agda infers things☆63Updated 7 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 5 months ago
- ☆32Updated 7 years ago
- Fast equality saturation in Haskell☆95Updated 2 weeks ago
- Extensions to cubical for categorical logic/type theory☆35Updated this week
- Prototype implementations of systems based on setoid type theory☆66Updated 5 years ago
- A work-in-progress core language for Agda, in Agda☆64Updated this week