TaktInc / freerLinks
☆23Updated 7 years ago
Alternatives and similar repositories for freer
Users that are interested in freer are comparing it to the libraries listed below
Sorting:
- Reasonable Haskell default import☆27Updated 3 years ago
- A convenient DSL for describing web routes☆42Updated 5 years ago
- Library to integrate eta wai applications with servlet api☆18Updated 6 years ago
- Priority Search Queues in three different flavors for Haskell☆67Updated 3 months ago
- Library and tool for parsing .eventlog files from GHC☆37Updated 3 months ago
- ☆24Updated 8 years ago
- Scrap Your Reprinter - A Datatype Generic Algorithm for Layout-Preserving Refactoring☆27Updated 4 years ago
- ☆67Updated 4 months ago
- van Laarhoven Free Monad with Extensible Effects☆24Updated 9 years ago
- An arrowized FRP library for Idris with static safety guarantees.☆16Updated 7 years ago
- Provides free functors that are adjoint to functors that forget class constraints.☆29Updated last year
- An experiment in functional interface design☆24Updated 9 years ago
- ☆31Updated 4 years ago
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated last month
- 🌳 a monadic FRP game library for haskell☆25Updated 5 years ago
- Comment on Haskell documentation.☆13Updated 6 years ago
- A Haskell translation of Idris's original algebraic effects library☆41Updated 9 years ago
- An effect system similar to mtl with explicit dictionary passing.☆17Updated 7 years ago
- Cofun with Cofree Comonads☆32Updated 9 years ago
- A collection of ready-to-use Prometheus Metrics to monitor your Haskell application☆13Updated 2 months ago
- Pure Haskell client for the Mandrill JSON API☆17Updated 8 months ago
- Browser plugin to automatically redirect Hackage library pages to Stackage pages.☆15Updated 8 years ago
- freer-effects wrapper for persistent queries☆12Updated 8 years ago
- Text-based interactive GHC .prof viewer☆48Updated 2 years ago
- Type-safe error handling☆64Updated 2 years ago
- Demonstrating comonad transformers.☆36Updated 9 years ago
- A reimplementation of `Data.IntMap` that uses minimum and maximum bounds on subtrees instread of bit prefixes.☆21Updated last year
- Override instances used by Haskell's generic derivation☆31Updated 3 years ago
- An implementation of "Freer Monads, More Extensible Effects".☆64Updated 7 years ago
- Delete half (minus ε) of your Haskell code!☆30Updated last month