sdiehl / dive-into-ghcLinks
Dive into GHC
☆82Updated 8 years ago
Alternatives and similar repositories for dive-into-ghc
Users that are interested in dive-into-ghc are comparing it to the libraries listed below
Sorting:
- Generic parser combinators☆87Updated 4 months ago
- Haskell 98 contravariant functors☆73Updated 8 months ago
- ☆41Updated 8 years ago
- A hip inductive theorem prover!☆89Updated 3 years ago
- Recursion schemes for Idris☆65Updated 6 years ago
- Clojure-style transients for Haskell☆32Updated 3 years ago
- Measure time complexity empirically.☆48Updated 9 years ago
- Link to preprints for POPL'18 and colocated events☆87Updated 7 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Generic Programming using True Sums of Products☆163Updated 6 months ago
- haskell lazy evaluation illustrated☆72Updated 8 years ago
- Another implementation of Frank.☆70Updated 7 years ago
- Reifies arbitrary Haskell terms into types that can be reflected back into terms☆103Updated 4 months ago
- Drafts, notes and resources for adding linear typing to GHC.☆78Updated 5 years ago
- Transactional key-value store written entirely in Haskell☆93Updated 4 years ago
- Hopefully verifiable code generation in GHC☆94Updated 8 years ago
- An either-or-both data type, with corresponding hybrid error/writer monad transformer.☆118Updated last month
- The Disco Discus Compiler☆174Updated 6 years ago
- Dynamic linking and runtime evaluation of Haskell, and C, including dependency chasing and package resolution.☆53Updated last year
- compiler with polyhedral optmization for a lazy functional programming language☆68Updated 7 years ago
- A Haskell translation of Idris's original algebraic effects library☆41Updated 8 years ago
- Hoed - A Lightweight Haskell Tracer and Debugger☆51Updated 4 years ago
- Monad Transformers and Classes☆76Updated 6 years ago
- Efficient implementation of the implicit treap data structure☆62Updated 3 years ago
- Dump GHC's abstract syntax trees☆41Updated 3 years ago
- JHC Haskell compiler split into reusable components☆58Updated 6 years ago
- Various data structures for use in the Idris Language.☆95Updated 5 years ago
- Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.☆100Updated last year
- A class for types that can be converted to a hash value☆103Updated 4 months ago
- A fast open-union type, suitable for 100+ contained alternatives.☆99Updated last year