rudymatela / conjure
Produce Haskell functions out of partial definitions
☆12Updated last month
Alternatives and similar repositories for conjure:
Users that are interested in conjure are comparing it to the libraries listed below
- Haskell library for doing category theory with a central role for profunctors☆21Updated this week
- An efficient graph library for Haskell☆39Updated 7 months ago
- Automation for releasing haskell packages☆18Updated last year
- Reimplementation of a subset of Cabal☆26Updated 3 weeks ago
- classical sequent calculus, embedded in Haskell☆19Updated 3 years ago
- It's Data.Graph, but it doesn't suck!☆16Updated 3 years ago
- Invertible parsing for S-expressions☆34Updated 6 months ago
- Hack idiom-brackets using GHC Source Plugin (8.6+)☆25Updated 6 years ago
- Overloaded plugin☆30Updated 9 months ago
- ☆26Updated 3 months ago
- using Data and Typeable to get a direct reflection system for free, when we're implementing a toy language in Haskell☆15Updated 5 years ago
- A library to profile time in a Haskell program☆17Updated 10 months ago
- A Galilean revolution for computing: Unboundedly scalable reliability and efficiency☆13Updated last year
- Constructs FAlgebras from typeclasses, making Haskell functions homoiconic☆18Updated 5 years ago
- A special-purpose processor for pure, non-strict functional languages☆28Updated 2 months ago
- GHC plugin to branch on whether a constraint is satisfied☆33Updated last week
- lazy generators with observation☆14Updated last year
- A compiler that translates a form of lambda calculus to C☆12Updated 11 months ago
- Haskell counters that can be safely incremented from multiple threads☆19Updated 3 months ago
- Refactorio is a tool with which you build and maintain software.☆19Updated 10 months ago
- Staged Streams and other stuff☆18Updated 2 years ago
- Fine-grained lattice primitives for Haskell☆36Updated last month
- An efficient finite map from (byte)strings to values.☆20Updated last month
- Existential type.☆37Updated 3 months ago
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Updated 3 weeks ago
- Compiler backend for generating Scheme code☆27Updated last year
- the dynabook but for haskell☆23Updated 5 years ago
- Markup language on top of Haskell☆12Updated 5 months ago
- Leightweight generalized parser combinators☆19Updated last year
- Extend GHC's type checker with user-defined rules, without writing a type checker plugin.☆18Updated 3 years ago