ennocramer / monad-dijkstra
Haskell monad transformer for weighted, non-deterministic computation
☆29Updated 11 months ago
Related projects ⓘ
Alternatives and complementary repositories for monad-dijkstra
- APIs for more recursive definitions☆19Updated 3 weeks ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆28Updated 3 years ago
- Low-overhead effect management for concrete monads☆37Updated 2 years ago
- ☆18Updated 3 years ago
- Composable Concurrent Computation Done Right☆30Updated last year
- Session Types with Priority in Linear Haskell☆25Updated 5 months ago
- higher-kinded data☆30Updated last year
- Tactic Metaprogramming in Haskell☆57Updated 5 years ago
- Generic functions for single-sorted first-order structural unification☆41Updated this week
- classical sequent calculus, embedded in Haskell☆19Updated 2 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- Implementing a small functional language with a combinator based graph-reduction machine☆28Updated 11 months ago
- rewrite rules for type-level equalities☆62Updated 7 months ago
- Funny little Haskell impl☆18Updated 4 years ago
- Compiler backend for generating Scheme code☆26Updated last year
- Order theory☆23Updated last year
- checkers for algebra driven design☆34Updated 2 years ago
- A GHC plugin and library for analysing GHC Core☆53Updated 2 years ago
- Existential type.☆36Updated 6 months ago
- A small package that demonstrates how to use LiquidHaskell as a GHC plugin☆24Updated 3 months ago
- Standard module for type-level programming in Haskell☆31Updated 5 years ago
- Profunctor optics for the endofunctor category on Hask☆27Updated 4 years ago
- ICFP tutorial☆40Updated 3 years ago
- Category theory formalized in cubical agda☆20Updated 4 years ago
- An extensible IO-like monad-like thing for Idris, with support for including linear subprograms☆22Updated 4 years ago
- Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)☆66Updated last month
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆33Updated 5 months ago
- ☆16Updated 2 years ago
- A non-interactive proof assistant using the Haskell type system☆35Updated 4 years ago
- experimenting with unlifted classes via backpack☆36Updated 2 years ago