konn / equational-reasoning-in-haskell
Agda-style equational reasoning in Haskell
☆52Updated 2 months ago
Alternatives and similar repositories for equational-reasoning-in-haskell:
Users that are interested in equational-reasoning-in-haskell are comparing it to the libraries listed below
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 2 years ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Codo notation for programming with comonads in Haskell☆26Updated 4 years ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 6 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 9 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 3 years ago
- Where my everyday research happens☆52Updated last week
- Session Types with Priority in Linear Haskell☆26Updated 9 months ago
- Folds for recursive types with GHC Generics☆26Updated 4 years ago
- Simple reflection of expressions☆33Updated 3 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 6 years ago
- Fine-grained lattice primitives for Haskell☆36Updated last month
- topos programming☆31Updated 6 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Updated 2 years ago
- Scrap Your Reprinter - A Datatype Generic Algorithm for Layout-Preserving Refactoring☆27Updated 3 years ago
- An experimental intermediate language for GHC☆36Updated 7 years ago
- An OS written in Idris (eventually...)☆19Updated 10 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 3 months ago
- Formally prove properties of Haskell programs using SBV/SMT.☆45Updated last week
- Compositional type checking for Haskell☆37Updated 13 years ago
- rewrite rules for type-level equalities☆62Updated 11 months ago
- Overloaded plugin☆30Updated 9 months ago
- Dependently typed elimination functions using singletons☆28Updated 2 months ago
- higher-kinded data☆30Updated last year
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆32Updated 2 years ago
- Existential type.☆37Updated 3 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 week