atzeus / reflectionwithoutremorse
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
- ☆33Updated 9 years ago
- ☆24Updated 8 years ago
- Playing with https://github.com/ekmett/machines☆51Updated 7 years ago
- Streaming data library built around first-class stream fusion for high efficiency☆11Updated 8 years ago
- Cofun with Cofree Comonads☆31Updated 8 years ago
- A Haskell program and library to derive instances for data types☆25Updated 4 years ago
- refine properties for testing Haskell programs☆74Updated last month
- A purely-functional, strongly-typed functional mocking library for Free programs☆49Updated 8 years ago
- the EitherT monad transformer☆55Updated 10 months ago
- ☆31Updated 3 years ago
- An alternate definition of Haskell's Functor typeclass☆42Updated 5 years ago
- van Laarhoven Free Monad with Extensible Effects☆23Updated 9 years ago
- ☆50Updated 3 months ago
- Scrap Your Reprinter - A Datatype Generic Algorithm for Layout-Preserving Refactoring☆27Updated 3 years ago
- Type-safe time units in Haskell☆49Updated last month
- A book about large-scale design in Haskell☆75Updated 10 years ago
- Haskell 98 contravariant functors☆73Updated 4 months ago
- Priority Search Queues in three different flavors for Haskell☆65Updated 3 weeks ago
- ☆11Updated 4 years ago
- HoTT Note-taking action☆25Updated 5 years ago
- Provides the region monad for safely opening and working with scarce resources☆33Updated 10 years ago
- Some useful control operators for looping☆48Updated 4 years ago
- Declare and access tuple fields with labels☆58Updated 6 years ago
- deprecated in favor of -XQualifiedDo☆41Updated 3 years ago
- A recursion scheme library for Idris.☆24Updated 3 months ago
- A more flexible mtl☆64Updated 7 years ago
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated last year
- Implementing Abstract Binding Trees (in Scala, ...)☆19Updated 9 years ago
- A reimplementation of `Data.IntMap` that uses minimum and maximum bounds on subtrees instread of bit prefixes.☆20Updated last year
- A Haskell translation of Idris's original algebraic effects library☆41Updated 8 years ago