konn / equational-reasoning-in-haskellLinks
Agda-style equational reasoning in Haskell
☆54Updated 7 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
Sorting:
- Classes for types where we know all the values☆39Updated 10 months ago
- Codo notation for programming with comonads in Haskell☆25Updated 4 years ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago
- An efficient graph library for Haskell☆38Updated 2 months ago
- ☆32Updated 7 years ago
- Compositional type checking for Haskell☆37Updated 14 years ago
- rewrite rules for type-level equalities☆62Updated 2 months ago
- Tactic Metaprogramming in Haskell☆56Updated 6 years ago
- topos programming☆31Updated 7 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆125Updated last year
- Grammatical parsers - combinator library for parsing general context-free grammars☆42Updated 2 weeks ago
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 6 months ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 3 years ago
- An embedded probabilistic programming language.☆34Updated 8 years ago
- Simple reflection of expressions☆34Updated 4 years ago
- Standard module for type-level programming in Haskell☆31Updated 6 years ago
- A package exposing a function for generating catamorphisms.☆28Updated 7 years ago
- Fine-grained lattice primitives for Haskell☆37Updated 4 months ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆29Updated 11 months ago
- Kleene algebra, regular expressions☆33Updated last year
- Exploring how to make a strict imperative universe in the GHC runtime system.☆49Updated 11 months ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- An experiment in functional interface design☆24Updated 9 years ago
- A hip inductive theorem prover!☆90Updated 3 years ago
- Ghosts of Departed Proofs☆61Updated 4 years ago
- Bidirectional programming in Haskell with monadic profunctors☆47Updated 3 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 3 months ago