csabahruska / jhc-componentsLinks
JHC Haskell compiler split into reusable components
☆57Updated 7 years ago
Alternatives and similar repositories for jhc-components
Users that are interested in jhc-components are comparing it to the libraries listed below
Sorting:
- Interpreter for GHC Haskell☆22Updated 6 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆128Updated last week
- Hedgehog will eat your typeclass bugs☆57Updated 7 months ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated last year
- A collection of Notes on GHC☆71Updated 6 years ago
- Lightweight package providing commonly useful parser combinators☆54Updated last week
- ☆41Updated 5 years ago
- Compact regions library for Haskell☆82Updated last year
- rewrite rules for type-level equalities☆62Updated 5 months ago
- Kan extensions, Kan lifts, the Yoneda lemma, and (co)monads generated by a functor☆83Updated 3 weeks ago
- Unpacked containers using backpack☆52Updated 5 years ago
- The compilation target that functional programmers always wanted.☆62Updated 5 years ago
- A fast open-union type, suitable for 100+ contained alternatives.☆100Updated last year
- Map lazy functional language constructs to LLVM IR☆52Updated 6 years ago
- A set of utilities for using indexed types including containers, equality, and comparison.☆60Updated last week
- A syntax for unions of constraints in Haskell☆70Updated 8 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 9 months ago
- Dependently-typed finite maps (partial dependent products)☆67Updated 3 months ago
- Generic Programming using True Sums of Products☆164Updated 3 weeks ago
- Efficient implementation of the implicit treap data structure☆63Updated 4 years ago
- A haskell numeric prelude, providing a clean structure for numbers and operations that combine them.☆71Updated 3 weeks ago
- Type-level well-kinded natural numbers.☆36Updated last year
- ICFP tutorial☆39Updated 4 years ago
- Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.☆67Updated 3 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago
- Dual Traversable☆41Updated 3 weeks ago
- ☆45Updated 4 years ago
- Bit vectors: 8x less memory, up to 3500x faster than Vector Bool☆76Updated last month
- Automatically trace all (showable) binds in do expressions☆84Updated 7 years ago