glebec / left-recursion
Quick explanation of eliminating left recursion in Haskell parsers
☆48Updated 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
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- Low-overhead effect management for concrete monads☆37Updated 2 years ago
- A Haskell monad transformer library for data validation☆36Updated last year
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- Example language server (LSP) implementation for a toy language☆60Updated 3 years ago
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated last month
- A beginner's guide to Haskell optimization☆64Updated 7 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- Bidirectional Parsing. Work in Progress☆32Updated 5 months ago
- A PureScript interpreter in Haskell☆119Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 8 months ago
- Fast and concise extensible effects☆108Updated last year
- Chapelure is a diagnostic library for Haskell☆44Updated last year
- Comparing Haskell effect systems for ergonomics and speed☆65Updated 3 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆54Updated 3 years ago
- Type-safe WebAssembly eDSL in Haskell☆25Updated 4 months ago
- Efficient parser combinators for Haskell☆39Updated 10 months ago
- Add early return to any do-expression☆46Updated 3 years ago
- bollu learns implementation of dependent typing☆28Updated 2 years ago
- Tactic Metaprogramming in Haskell☆56Updated 5 years ago
- A tool to make solving type errors in Haskell simple and fun.☆36Updated 2 years ago
- ☆40Updated 5 years ago
- A dependently typed programming language with direct style effects and linearity☆19Updated 7 months ago
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 3 years ago
- Trie-based memo functions☆92Updated last month
- 🚧 a work in progress effect system for Haskell 🚧☆124Updated last year
- Type inference from scratch - Material for my talk at F(by)19☆64Updated 5 years ago
- Fast higher-order effect handlers with evidence passing☆19Updated last year
- Kotlin-backend for PureScript☆81Updated 3 years ago
- ☆89Updated 3 years ago