mroman42 / vitreaLinks
Optics via the profunctor representation theorem
☆24Updated 6 months ago
Alternatives and similar repositories for vitrea
Users that are interested in vitrea are comparing it to the libraries listed below
Sorting:
- Free Algebras in Haskell☆37Updated 9 months ago
- An effect system based on type classes, written in Haskell.☆45Updated 3 years ago
- Haskell monad transformer for weighted, non-deterministic computation☆30Updated 4 months ago
- [WIP] Optics via the profunctor representation theorem☆19Updated 5 years ago
- A set of utilities for using indexed types including containers, equality, and comparison.☆60Updated this week
- Haskell embedding of PlusCal☆61Updated 3 years ago
- Dependently-typed finite maps (partial dependent products)☆66Updated 4 months ago
- Comparing Haskell effect systems for ergonomics and speed☆66Updated 4 years ago
- Recursion schemes for Idris☆65Updated 6 years ago
- Braiding extensible effects together in a pipeline/workflow of tasks☆60Updated last year
- Haskell library for doing category theory with a central role for profunctors☆21Updated this week
- First-class type families☆88Updated last month
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- An efficient graph library for Haskell☆39Updated 3 weeks ago
- Haskell library for semigroup actions and torsors☆62Updated 4 months ago
- ☆30Updated 7 years ago
- Provides a type-safe way of working with permutations in Idris☆35Updated 3 years ago
- Automatic piecewise-mutable references for your types☆42Updated 4 years ago
- Yet another yet another recursion scheme library in Haskell.☆89Updated this week
- Implementing a small functional language with a combinator based graph-reduction machine☆31Updated last year
- Use Pandoc to write simple reports within haskell code. Inspired by R-markdown.☆29Updated 5 months ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated 2 years ago
- Interpret Haskell programs into any cartesian closed category.☆61Updated last month
- Fine-grained lattice primitives for Haskell☆37Updated last month
- high-powered optics in a small package☆53Updated 8 months ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- Library of categories, with categorical constructions on them☆56Updated last year
- Bit vectors: 8x less memory, up to 3500x faster than Vector Bool☆72Updated 2 weeks ago
- Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor☆79Updated this week