TOTBWF / refinery
⛏️ A refinement proof framework for haskell
☆69Updated last year
Related projects ⓘ
Alternatives and complementary repositories for refinery
- Tactic Metaprogramming in Haskell☆57Updated 5 years ago
- rewrite rules for type-level equalities☆62Updated 7 months ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- Libraries for the Effectful Haskell effects system☆22Updated 2 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆122Updated 3 months ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- Interpreter for GHC Haskell☆22Updated 5 years ago
- An effect system based on type classes, written in Haskell.☆44Updated 3 years ago
- Dependently-typed finite maps (partial dependent products)☆63Updated 5 months ago
- Reimplementation of Parsley in Haskell, with improvements☆50Updated 8 months ago
- Dependent sums and supporting typeclasses for comparing and displaying them☆54Updated last year
- Where my everyday research happens☆53Updated last week
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 4 years ago
- high-powered optics in a small package☆50Updated last month
- Chapelure is a diagnostic library for Haskell☆44Updated last year
- Bit vectors: 8x less memory, up to 3500x faster than Vector Bool☆73Updated last month
- Haskell embedding of PlusCal☆61Updated 2 years ago
- ICFP tutorial☆40Updated 3 years ago
- Generic functions for single-sorted first-order structural unification☆41Updated this week
- type level sets☆67Updated 5 years ago
- experimenting with unlifted classes via backpack☆36Updated 2 years ago
- Generic data types in Haskell, utilities for GHC.Generics☆44Updated last month
- 💄🐞 Combinators for writing pretty type errors easily☆55Updated 2 years ago
- Fine-grained lattice primitives for Haskell☆35Updated 3 months ago
- Bidirectional Parsing. Work in Progress☆30Updated 2 months ago
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆33Updated 5 months ago
- Standard containers, with keys that carry type-level proofs of their own presence.☆80Updated 4 years ago
- Strict Text and ByteString builder, which hides mutable buffer behind linear types and takes amortized linear time.☆88Updated 3 months ago
- ️🌈 Convenient interface for printing colourful messages☆66Updated last month
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 5 months ago