YellPika / constraint-rules
Extend GHC's type checker with user-defined rules, without writing a type checker plugin.
☆18Updated 3 years ago
Alternatives and similar repositories for constraint-rules:
Users that are interested in constraint-rules are comparing it to the libraries listed below
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Updated last month
- Overloaded plugin☆30Updated 8 months ago
- experimenting with unlifted classes via backpack☆36Updated 2 years ago
- Staged Streams and other stuff☆18Updated 2 years ago
- GHC plugin to branch on whether a constraint is satisfied☆33Updated 3 months ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 6 years ago
- rewrite rules for type-level equalities☆62Updated 10 months ago
- Normalise GHC.TypeLits.Nat equations☆43Updated last week
- Composable Concurrent Computation Done Right☆30Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- Existential type.☆37Updated 2 months ago
- Sort any Traversable container☆41Updated 2 years ago
- Leightweight generalized parser combinators☆19Updated last year
- A usable type system for call by push-value☆33Updated 5 years ago
- Omit fields for instance deriving☆37Updated 4 years ago
- Extensible type-safe unions for Haskell☆33Updated 6 months ago
- checkers for algebra driven design☆34Updated 2 years ago
- Haskell library for doing category theory with a central role for profunctors☆21Updated this week
- Demonstrating how to make type families faster using typechecker plugins☆21Updated 4 years ago
- Functions and newtype wrappers for traversing Trees☆30Updated 6 months ago
- Haskell Type Level Example Programs☆29Updated 7 years ago
- There are many category theory implementations, but this one is mine☆15Updated 6 months ago
- Generic data types in Haskell, utilities for GHC.Generics☆45Updated 2 months ago
- ☆9Updated 4 months ago
- ☆18Updated 3 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- experiments with pext/pdep and codebruijn syntax☆17Updated 5 years ago
- Type Your Matrices For Great Good☆30Updated 4 years ago
- Standard module for type-level programming in Haskell☆31Updated 5 years ago
- An experimental Haskell library for programming with effectful runners.☆29Updated 5 years ago