emilaxelsson / ho-rewritingLinks
A generic Haskell library for expressing rewrite rules with safe treatment of variables and binders
☆12Updated 7 years ago
Alternatives and similar repositories for ho-rewriting
Users that are interested in ho-rewriting are comparing it to the libraries listed below
Sorting:
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- Fine-grained lattice primitives for Haskell☆37Updated 4 months ago
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- A monadic interface for DAG construction.☆24Updated 4 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 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 3 months ago
- Agda-style equational reasoning in Haskell☆54Updated 7 months ago
- Demonstration for how to build "traverse" using GHC.Generics efficiently☆22Updated 7 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- An experimental intermediate language for GHC☆36Updated 8 years ago
- Classes for types where we know all the values☆39Updated 10 months ago
- wherein I implement several substructural logics in Agda☆24Updated 7 years ago
- ☆20Updated 2 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 6 months ago
- rewrite rules for type-level equalities☆62Updated 2 months ago
- experiments with pext/pdep and codebruijn syntax☆17Updated 5 years ago
- This is the place where (more or less) stable releases of my RW library will be published.☆16Updated 5 years ago
- NbE course @ Chalmers☆28Updated last year
- Ghosts of Departed Proofs☆61Updated 4 years ago
- Haskell Type Level Example Programs☆28Updated 7 years ago
- do-notation for Category and "Arrow without arr"☆62Updated 8 years ago
- A monadic approach to static analysis following the methodology of AAM☆18Updated 10 years ago
- ☆20Updated last year
- Overloaded plugin☆31Updated last year
- Codo notation for programming with comonads in Haskell☆25Updated 4 years ago
- Type-level sets for Haskell (with value-level counterparts and various operations)☆66Updated 3 weeks ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- Slides for my Haskell Symposium 2015 lighting talk☆13Updated 10 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Small implementation of OutsideIn(X) type checking algorithm☆31Updated 10 years ago