glebec / left-recursion
Quick explanation of eliminating left recursion in Haskell parsers
☆49Updated 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
- Prototype for https://github.com/Innf107/vega☆19Updated 9 months ago
- Low-overhead effect management for concrete monads☆37Updated 3 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- Example language server (LSP) implementation for a toy language☆59Updated 3 years ago
- Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)☆68Updated 2 weeks ago
- Efficient Haskell effect handlers based on evidence translation.☆82Updated 3 years ago
- ICFP tutorial☆39Updated 3 years ago
- Add early return to any do-expression☆46Updated 3 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Comparing Haskell effect systems for ergonomics and speed☆66Updated 4 years ago
- Chapelure is a diagnostic library for Haskell☆45Updated last year
- A tool to make solving type errors in Haskell simple and fun.☆36Updated 2 years ago
- A Haskell monad transformer library for data validation☆36Updated last year
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- A beginner's guide to Haskell optimization☆64Updated 7 years ago
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated 2 months ago
- Generic functions for single-sorted first-order structural unification☆43Updated 3 weeks ago
- Language Server for Agda☆108Updated 4 months ago
- An effect system based on type classes, written in Haskell.☆44Updated 3 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆56Updated 4 years ago
- Duo - A research language exploring duality in programming language design☆57Updated last year
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 4 years ago
- Fast equality saturation in Haskell☆84Updated 2 months ago
- Standard containers, with keys that carry type-level proofs of their own presence.☆80Updated 5 years ago
- A PureScript interpreter in Haskell☆120Updated 2 years ago
- Type inference from scratch - Material for my talk at F(by)19☆64Updated 5 years ago
- Experimental effects library for Idris 2☆42Updated 2 years ago
- Haskell monad transformer for weighted, non-deterministic computation☆30Updated 3 months ago
- Convert values from one type into another.☆77Updated this week