morphismtech / distributorsLinks
Distributors - Unifying Parsers, Printers & Grammars
☆25Updated 3 weeks ago
Alternatives and similar repositories for distributors
Users that are interested in distributors are comparing it to the libraries listed below
Sorting:
- A non-interactive proof assistant using the Haskell type system☆37Updated 5 years ago
- A tutorial on how Agda infers things☆42Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- NbE course @ Chalmers☆28Updated 8 months ago
- Staged push/pull fusion with typed Template Haskell☆59Updated last year
- Eventually a practical 2-level TT-based compiler☆27Updated 2 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- A Really Cool Calculator written in Haskell... or is it?☆43Updated 3 years ago
- Fast equality saturation in Haskell☆84Updated 3 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- experimenting with unlifted classes via backpack☆36Updated 2 years ago
- ☆47Updated this week
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- Profunctor optics for the endofunctor category on Hask☆27Updated 4 years ago
- Where my everyday research happens☆53Updated last month
- Haskell library for doing category theory with a central role for profunctors☆21Updated this week
- A small package that demonstrates how to use LiquidHaskell as a GHC plugin☆24Updated 9 months ago
- Paper and talk☆54Updated last year
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 5 years ago
- Leightweight generalized parser combinators☆20Updated last year
- Formalization of Mathematics using Type Theory of Agda Programming Language☆11Updated 7 years ago
- A self-contained repository for the paper Type and Scope Preserving Semantics☆23Updated 6 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 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 2 months ago
- ⛏️ A refinement proof framework for haskell☆69Updated 2 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆101Updated 3 years ago
- Reimplementation of Parsley in Haskell, with improvements☆56Updated last year
- A library for doing generic programming in Agda☆31Updated 4 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆71Updated 6 years ago