TOTBWF / refinery
⛏️ A refinement proof framework for haskell
☆69Updated 2 years ago
Alternatives and similar repositories for refinery:
Users that are interested in refinery are comparing it to the libraries listed below
- Tactic Metaprogramming in Haskell☆56Updated 5 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆123Updated 9 months 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
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- Bit vectors: 8x less memory, up to 3500x faster than Vector Bool☆72Updated last month
- An implementation of a Relaxed Radix Balanced Vector in Haskell.☆26Updated 2 months ago
- Hypertypes - generic programming for heterogeneous recursive types☆121Updated 3 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- rewrite rules for type-level equalities☆62Updated last year
- Standard containers, with keys that carry type-level proofs of their own presence.☆80Updated 5 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Fast equality saturation in Haskell☆84Updated 2 months ago
- Where my everyday research happens☆52Updated last week
- Normalise GHC.TypeLits.Nat equations☆43Updated 2 weeks ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 10 months ago
- Libraries for the Effectful Haskell effects system☆22Updated 3 years ago
- experimenting with unlifted classes via backpack☆36Updated 2 years ago
- Interpreter for GHC Haskell☆22Updated 5 years ago
- An effect system based on type classes, written in Haskell.☆44Updated 3 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- GRIN backend for Idris☆51Updated 5 years ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- Strict Text and ByteString builder, which hides mutable buffer behind linear types and takes amortized linear time.☆94Updated 3 weeks ago
- A set of utilities for using indexed types including containers, equality, and comparison.☆60Updated 2 weeks ago
- 💄🐞 Combinators for writing pretty type errors easily☆56Updated 3 years ago
- A Typeclass for user-facing output☆56Updated last month
- Haskell library for doing category theory with a central role for profunctors☆21Updated last week
- type level sets☆67Updated 5 years ago
- System F-omega normalization by hereditary substitution in Agda☆58Updated 5 years ago