atzeus / reflectionwithoutremorseLinks
Code accompanying the paper Reflection without Remorse:Revealing a hidden sequence to speed up monadic reflection
☆66Updated 3 years ago
Alternatives and similar repositories for reflectionwithoutremorse
Users that are interested in reflectionwithoutremorse are comparing it to the libraries listed below
Sorting:
- Cofun with Cofree Comonads☆32Updated 9 years ago
- A typeclass and set of functions for working with newtypes.☆10Updated 3 years ago
- Playing with https://github.com/ekmett/machines☆51Updated 8 years ago
- Haskell 98 Profunctors☆70Updated 2 months ago
- Commutative Applicatives and Semigroups☆31Updated 7 years ago
- deprecated in favor of -XQualifiedDo☆41Updated 4 years ago
- the EitherT monad transformer☆55Updated 2 months ago
- ☆19Updated 2 weeks ago
- Reasonable Haskell default import☆27Updated 2 years ago
- Free applicative functors for PureScript☆27Updated 3 years ago
- Provides free functors that are adjoint to functors that forget class constraints.☆29Updated 11 months ago
- Exhaustive pattern matching using lenses, traversals, and prisms☆32Updated 2 years ago
- Browser plugin to automatically redirect Hackage library pages to Stackage pages.☆15Updated 8 years ago
- ☆24Updated 8 years ago
- ☆23Updated 7 years ago
- van Laarhoven Free Monad with Extensible Effects☆23Updated 9 years ago
- ST with efficient exceptions☆20Updated 8 years ago
- Priority Search Queues in three different flavors for Haskell☆67Updated 2 weeks ago
- Operational monad library☆30Updated 3 years ago
- ☆31Updated 3 years ago
- United Monoids☆24Updated 2 years ago
- Operational-style Applicative, Alternative, Monad and MonadPlus, using free monads.☆25Updated 8 years ago
- IO without any PseudoExceptions☆28Updated 5 years ago
- A reimplementation of `Data.IntMap` that uses minimum and maximum bounds on subtrees instread of bit prefixes.☆21Updated last year
- Generate a cabal freeze file from a stack.yaml☆36Updated 6 years ago
- A more flexible mtl☆64Updated 7 years ago
- An implementation of "Freer Monads, More Extensible Effects".☆64Updated 7 years ago
- Getting more out of your transformers with classy optics. Slides from my BFPG talk on 2015-06-09☆32Updated 10 years ago
- lazy promises☆28Updated 4 years ago
- A Haskell program and library to derive instances for data types☆25Updated 5 years ago