precog / purescript-mraLinks
A definition and reference implementation for MRA in PureScript.
☆17Updated 8 years ago
Alternatives and similar repositories for purescript-mra
Users that are interested in purescript-mra are comparing it to the libraries listed below
Sorting:
- Implementing Abstract Binding Trees (in Scala, ...)☆19Updated 10 years ago
- Cofun with Cofree Comonads☆32Updated 9 years ago
- A Haskell translation of Idris's original algebraic effects library☆41Updated 9 years ago
- Wailing into the primordial ooze of category theory☆55Updated this week
- van Laarhoven Free Monad with Extensible Effects☆24Updated 9 years ago
- A total recursion scheme library for Dhall☆66Updated last month
- Some useful control operators for looping☆47Updated 5 years ago
- ☆24Updated 9 years ago
- An arrowized FRP library for Idris with static safety guarantees.☆16Updated 7 years ago
- ☆89Updated last year
- Streaming data library built around first-class stream fusion for high efficiency☆12Updated 9 years ago
- ☆23Updated 7 years ago
- Simple adjunctions☆45Updated 3 weeks ago
- Reifies arbitrary Haskell terms into types that can be reflected back into terms☆104Updated 11 months ago
- Provides free functors that are adjoint to functors that forget class constraints.☆29Updated last month
- Provides a type-safe way of working with permutations in Idris☆37Updated 4 years ago
- HoTT Note-taking action☆25Updated 6 years ago
- Provides the region monad for safely opening and working with scarce resources☆33Updated 10 years ago
- Scrap Your Boilerplate generic programming library in Haskell☆45Updated 5 months ago
- A http client for Idris based on libcurl☆10Updated 9 years ago
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated 3 months ago
- Paper about polynomial functors, regular expressions, matrices of types, derivatives, semirings, and other cool stuff☆14Updated 7 years ago
- Sort any Traversable container☆42Updated 3 years ago
- A JVM bytecode assembler written in Haskell.☆35Updated 9 years ago
- A reimplementation of `Data.IntMap` that uses minimum and maximum bounds on subtrees instread of bit prefixes.☆21Updated 2 years ago
- Research middleware compiler from System F-based languages to Java with the Imperative Functional Object encoding☆46Updated 10 years ago
- Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.☆99Updated 3 months ago
- A set of patches to make Hackage compatible with the Eta language.☆64Updated 6 years ago
- Declare and access tuple fields with labels☆59Updated 7 years ago
- being the materials for CS410 Advanced Functional Programming in the 2015/16 session☆40Updated 9 years ago