TOTBWF / refineryLinks
⛏️ A refinement proof framework for haskell
☆70Updated 2 years ago
Alternatives and similar repositories for refinery
Users that are interested in refinery are comparing it to the libraries listed below
Sorting:
- Tactic Metaprogramming in Haskell☆56Updated 6 years ago
- Reimplementation of Parsley in Haskell, with improvements☆57Updated last year
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆124Updated last year
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- Hypertypes - generic programming for heterogeneous recursive types☆125Updated 7 months ago
- Haskell library for doing category theory with a central role for profunctors☆23Updated this week
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- rewrite rules for type-level equalities☆62Updated 2 weeks ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Interpreter for GHC Haskell☆22Updated 5 years ago
- Where my everyday research happens☆55Updated 2 months ago
- Libraries for the Effectful Haskell effects system☆23Updated 3 years ago
- A structured concurrency library☆85Updated 6 months ago
- Fast equality saturation in Haskell☆87Updated last month
- An implementation of a Relaxed Radix Balanced Vector in Haskell.☆29Updated 6 months ago
- type level sets☆67Updated 5 years ago
- Haskell library for semigroup actions and torsors☆64Updated 7 months ago
- Bidirectional Parsing. Work in Progress☆33Updated 11 months ago
- Forward-propagating Constraint Solver monad. Good for solving Sudoku, N-Queens, etc.☆67Updated 2 years ago
- Strict Text and ByteString builder, which hides mutable buffer behind linear types and takes amortized linear time.☆96Updated 3 months ago
- Normalise GHC.TypeLits.Nat equations☆43Updated this week
- Bit vectors: 8x less memory, up to 3500x faster than Vector Bool☆76Updated last week
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 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 last month
- A set of utilities for using indexed types including containers, equality, and comparison.☆60Updated this week
- GHC plugin to branch on whether a constraint is satisfied☆33Updated last month
- Distributors - Unifying Parsers, Printers & Grammars☆46Updated this week
- Fine-grained lattice primitives for Haskell☆37Updated 2 months ago
- Generic functions for single-sorted first-order structural unification☆46Updated 4 months ago