j-mie6 / design-patterns-for-parser-combinatorsLinks
A Really Cool Calculator written in Haskell... or is it?
☆43Updated 4 years ago
Alternatives and similar repositories for design-patterns-for-parser-combinators
Users that are interested in design-patterns-for-parser-combinators are comparing it to the libraries listed below
Sorting:
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 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 4 months ago
- Reimplementation of Parsley in Haskell, with improvements☆60Updated last month
- experimenting with unlifted classes via backpack☆36Updated 3 years ago
- Staged push/pull fusion with typed Template Haskell☆62Updated last year
- ☆26Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 5 years ago
- Distributors - Unifying Parsers, Printers & Grammars☆59Updated this week
- A library for doing generic programming in Agda☆34Updated 4 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 7 months ago
- ⛏️ A refinement proof framework for haskell☆70Updated 2 years ago
- Fine-grained lattice primitives for Haskell☆37Updated 5 months ago
- NbE course @ Chalmers☆28Updated last year
- rewrite rules for type-level equalities☆62Updated 3 months ago
- Session Types with Priority in Linear Haskell☆27Updated last year
- GHC plugin to branch on whether a constraint is satisfied☆33Updated 4 months ago
- Staged Streams and other stuff☆19Updated 3 years ago
- Where my everyday research happens☆55Updated 3 weeks ago
- higher-kinded data☆30Updated 2 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆57Updated 6 years ago
- A virtual memory scanner☆10Updated last year
- A non-interactive proof assistant using the Haskell type system☆38Updated 5 years ago
- ☆51Updated 3 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- Tactic Metaprogramming in Haskell☆56Updated 6 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆127Updated last year
- Existential type.☆37Updated 11 months ago
- ☆18Updated 4 years ago
- Normalise GHC.TypeLits.Nat equations☆43Updated last week
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago