glebec / left-recursionLinks
Quick explanation of eliminating left recursion in Haskell parsers
☆50Updated 3 years ago
Alternatives and similar repositories for left-recursion
Users that are interested in left-recursion are comparing it to the libraries listed below
Sorting:
- Example language server (LSP) implementation for a toy language☆59Updated 3 years ago
- A PureScript interpreter in Haskell☆120Updated 3 years ago
- A beginner's guide to Haskell optimization☆64Updated 7 years ago
- Fast and concise extensible effects☆108Updated last year
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- todo and unimplemented, robustly implemented☆36Updated 8 months ago
- ☆88Updated 3 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆53Updated 8 years ago
- Chapelure is a diagnostic library for Haskell☆45Updated last year
- Prototype for https://github.com/Innf107/vega☆19Updated 10 months ago
- A tool to make solving type errors in Haskell simple and fun.☆36Updated 2 years ago
- Type-safe WebAssembly eDSL in Haskell☆26Updated 7 months ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated 2 years ago
- Kotlin-backend for PureScript☆80Updated 3 years ago
- Comparing Haskell effect systems for ergonomics and speed☆66Updated 4 years ago
- ICFP tutorial☆39Updated 3 years ago
- A Haskell monad transformer library for data validation☆36Updated last year
- Ghosts of Departed Proofs☆60Updated 4 years ago
- Show Haskell type annotations when doing code review on Github☆142Updated 4 years ago
- classical sequent calculus, embedded in Haskell☆20Updated 3 years ago
- Example implementation of Algorithm W for Hindley-Milner type inference☆80Updated 3 years ago
- Add early return to any do-expression☆46Updated 3 years ago
- Low-overhead effect management for concrete monads☆37Updated 3 years ago
- Type inference from scratch - Material for my talk at F(by)19☆64Updated 5 years ago
- Haskell monad transformer for weighted, non-deterministic computation☆30Updated 4 months ago
- high-powered optics in a small package☆53Updated 8 months ago
- Javascript DOM bindings for Idris2☆52Updated last year
- An effect system based on type classes, written in Haskell.☆44Updated 3 years ago
- Fast higher-order effect handlers with evidence passing☆21Updated last year