kowainik / first-class-patternsLinks
First class patterns and pattern matching, using type families
☆17Updated 4 years ago
Alternatives and similar repositories for first-class-patterns
Users that are interested in first-class-patterns are comparing it to the libraries listed below
Sorting:
- Generic functions for single-sorted first-order structural unification☆46Updated 5 months ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- Funny little Haskell impl☆18Updated 5 years ago
- Dependently typed elimination functions using singletons☆28Updated 10 months ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- Codo notation for programming with comonads in Haskell☆25Updated 4 years ago
- Existential type.☆37Updated 10 months ago
- Deep evaluation of data structures☆43Updated 4 months ago
- Session Types with Priority in Linear Haskell☆27Updated last year
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- GRIN backend for Idris☆50Updated 5 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- higher-kinded data☆30Updated 2 years ago
- An experimental intermediate language for GHC☆36Updated 8 years ago
- Efficient parser combinators for Haskell☆39Updated last month
- Agda-style equational reasoning in Haskell☆54Updated 6 months ago
- The Str signature and implementations☆21Updated 8 years ago
- A small package that demonstrates how to use LiquidHaskell as a GHC plugin☆24Updated last year
- Combinators for manipulating dependently-typed predicates.☆14Updated last year
- Artefact from the POPL'16 paper "Effects as Sessions, Sessions as Effects"☆15Updated 7 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Composable Concurrent Computation Done Right☆30Updated 2 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- A monadic (and pretty) pretty printer for Haskell☆39Updated 2 years ago
- A usable type system for call by push-value☆33Updated 5 years ago
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Updated 3 months ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Extra type-level operations on GHC.TypeLits.Nat and a custom solver☆18Updated last week
- ICFP tutorial☆39Updated 4 years ago
- Type Safe LLVM IR ( Experimental )☆49Updated 7 years ago