rudymatela / conjure
Produce Haskell functions out of partial definitions
☆12Updated this week
Alternatives and similar repositories for conjure
Users that are interested in conjure are comparing it to the libraries listed below
Sorting:
- Automation for releasing haskell packages☆18Updated last year
- Haskell library for doing category theory with a central role for profunctors☆21Updated last week
- An efficient graph library for Haskell☆39Updated 9 months ago
- Invertible parsing for S-expressions☆34Updated last month
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- Hack idiom-brackets using GHC Source Plugin (8.6+)☆25Updated 6 years ago
- Constructs FAlgebras from typeclasses, making Haskell functions homoiconic☆18Updated 6 years ago
- A special-purpose processor for pure, non-strict functional languages☆28Updated 4 months ago
- GHC plugin to branch on whether a constraint is satisfied☆33Updated last month
- ☆26Updated 4 months ago
- It's Data.Graph, but it doesn't suck!☆16Updated 3 years ago
- Reimplementation of a subset of Cabal☆26Updated 2 months ago
- Linear Types, Symmetric Monoidal Categories, and Tensors☆12Updated last year
- Automatic type class law checking.☆24Updated 4 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
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- A plugin for circuit notation☆11Updated 5 months ago
- Haskell counters that can be safely incremented from multiple threads☆19Updated 5 months ago
- the dynabook but for haskell☆23Updated 5 years ago
- Fine-grained lattice primitives for Haskell☆37Updated last week
- lazy generators with observation☆14Updated last year
- Existential type.☆37Updated 4 months ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Fast parallel calculations in pure mathematics, e.g. Gröbner Bases☆16Updated 8 months ago
- Library and tool to render the snippets in literate Agda files to hyperlinked HTML, leaving the rest of the text untouched.☆11Updated 7 years ago
- Dependently typed elimination functions using singletons☆28Updated 4 months ago
- Generic functions for single-sorted first-order structural unification☆46Updated 2 weeks ago
- An efficient finite map from (byte)strings to values.☆20Updated 2 weeks ago
- Leightweight generalized parser combinators☆20Updated last year
- Compiler backend for generating Scheme code☆26Updated last year