Alternatives and similar repositories for refinery:

Users that are interested in refinery are comparing it to the libraries listed below

• TOTBWF / tactic-haskell
  Tactic Metaprogramming in Haskell
  ☆56Updated 5 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• isovector / type-sets
  type level sets
  ☆67Updated 5 years ago
• andorp / mini-grin
  ICFP tutorial
  ☆39Updated 3 years ago
• ekmett / bound
  Combinators for manipulating locally-nameless generalized de Bruijn terms
  ☆123Updated 7 months ago
• gallais / potpourri
  Where my everyday research happens
  ☆52Updated last week
• haskell-effectful / effectful-contrib
  Libraries for the Effectful Haskell effects system
  ☆22Updated 2 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated last year
• ekmett / linear-logic
  They see me rollin'. They're Heyting. -- Chamillionaire, 2005
  ☆83Updated 3 years ago
• j-mie6 / ParsleyHaskell
  Reimplementation of Parsley in Haskell, with improvements
  ☆52Updated last year
• typedbyte / effet
  An effect system based on type classes, written in Haskell.
  ☆44Updated 3 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆57Updated 5 years ago
• ekmett / unboxed
  experimenting with unlifted classes via backpack
  ☆36Updated 2 years ago
• alt-romes / hegg
  Fast equality saturation in Haskell
  ☆84Updated last month
• well-typed / recover-rtti
  Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).
  ☆35Updated last week
• lamdu / hypertypes
  Hypertypes - generic programming for heterogeneous recursive types
  ☆121Updated 2 months ago
• sweirich / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆29Updated 3 years ago
• Lysxia / profunctor-monad
  Bidirectional programming in Haskell with monadic profunctors
  ☆46Updated 2 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 9 months ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆52Updated 7 years ago
• haskell-perf / graphs
  ☆40Updated 5 years ago
• gelisam / typelevel-rewrite-rules
  rewrite rules for type-level equalities
  ☆62Updated 11 months ago
• Bodigrim / bitvec
  Bit vectors: 8x less memory, up to 3500x faster than Vector Bool
  ☆72Updated 2 months ago
• chrisdone-archive / prana
  Interpreter for GHC Haskell
  ☆22Updated 5 years ago
• bjpop / ministg
  Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
  ☆72Updated 5 years ago
• wrengr / unification-fd
  Generic functions for single-sorted first-order structural unification
  ☆42Updated 3 weeks ago
• re-xyr / avail
  Low-overhead effect management for concrete monads
  ☆37Updated 2 years ago
• well-typed / memory-usage-zurihac-2021
  ☆34Updated 3 years ago
• wz1000 / HieDb
  Generates a references DB from .hie files
  ☆65Updated 8 months ago
• Gabriella439 / HasCal
  Haskell embedding of PlusCal
  ☆61Updated 2 years ago