jwiegley / parsec-freeLinks
☆23Updated last year
Alternatives and similar repositories for parsec-free
Users that are interested in parsec-free are comparing it to the libraries listed below
Sorting:
- Hack idiom-brackets using GHC Source Plugin (8.6+)☆25Updated 7 years ago
- Exploring how to make a strict imperative universe in the GHC runtime system.☆48Updated 7 months ago
- Dependently typed elimination functions using singletons☆28Updated 6 months ago
- A package re-exporting the verified subset of containers☆20Updated 7 years ago
- Folds for recursive types with GHC Generics☆26Updated 5 years ago
- Visualization of Haskell data structures☆16Updated last year
- This a type-checker plugin to rule all type checker plugins involving type-equality reasoning using smt solvers.☆21Updated 3 years ago
- Funny little Haskell impl☆18Updated 4 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Updated 7 years ago
- Codo notation for programming with comonads in Haskell☆25Updated 4 years ago
- GHC prof manipulation script☆32Updated last year
- ☆18Updated 2 years ago
- Deriving Storable instances using GHC.Generics☆16Updated 3 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- static analysis of free monads☆24Updated 7 years ago
- Church-encoding of the Freer monad☆28Updated 8 years ago
- Uniform interface to reified data type information via Template Haskell☆21Updated 4 months ago
- types and functions bridge between foundation and the actual ecosystem (text, vector, bytestring, ...☆18Updated 8 years ago
- ☆40Updated 5 years ago
- ☆17Updated 2 years ago
- 💧 Liquid Haskell integration for Cabal and Stack☆25Updated 6 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- An efficient finite map from (byte)strings to values.☆20Updated 2 months ago
- Extra type-level operations on GHC.TypeLits.Nat and a custom solver☆18Updated 4 months ago
- Fine-grained lattice primitives for Haskell☆37Updated 2 weeks ago
- Hash consing for arbitrary Haskell data types☆25Updated 7 months ago
- Code to go along with the blog post "Are Mutable References in Haskell Fast?"☆10Updated 8 years ago
- effectful sequences of bytes; an alternative no-lazy-io implementation of Data.ByteString.Lazy☆18Updated 5 months ago
- GRIN Haskell backend stripped out from JHC. (GRIN from scratch: https://github.com/grin-tech/grin)☆16Updated 6 years ago