Alternatives and similar repositories for left-recursion:

Users that are interested in left-recursion are comparing it to the libraries listed below

• bkomuves / toy-language-server
  Example language server (LSP) implementation for a toy language
  ☆60Updated 3 years ago
• xnning / EvEff
  Efficient Haskell effect handlers based on evidence translation.
  ☆82Updated 3 years ago
• ekmett / linear-logic
  They see me rollin'. They're Heyting. -- Chamillionaire, 2005
  ☆83Updated 3 years ago
• anton-k / hindley-milner-type-check
  Haskell library for type-inference with Hindley-Milner type-system.
  ☆34Updated 8 months ago
• re-xyr / avail
  Low-overhead effect management for concrete monads
  ☆37Updated 2 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆77Updated 4 years ago
• TOTBWF / refinery
  ⛏️ A refinement proof framework for haskell
  ☆69Updated last year
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆107Updated 2 years ago
• Lysxia / bluefin-algae
  Algebraic effects in the Bluefin effect system
  ☆15Updated 9 months ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆52Updated 2 years ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• eayus / sirdi
  Package manager for Idris
  ☆35Updated 2 years ago
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆52Updated 7 years ago
• lexi-lambda / monad-validate
  A Haskell monad transformer library for data validation
  ☆36Updated last year
• solomon-b / lambda-calculus-hs
  Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques
  ☆44Updated last week
• Bodigrim / poly
  Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)
  ☆68Updated 4 months ago
• andorp / mini-grin
  ICFP tutorial
  ☆39Updated 3 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆76Updated 11 years ago
• frizensami / haskell-optimization
  A beginner's guide to Haskell optimization
  ☆64Updated 7 years ago
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆123Updated last year
• Innf107 / vega
  A dependently typed programming language with direct style effects and linearity
  ☆19Updated 7 months ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆54Updated 3 years ago
• paf31 / dovetail
  A PureScript interpreter in Haskell
  ☆119Updated 2 years ago
• balint99 / sfpl
  A simple functional programming language.
  ☆21Updated 3 years ago
• ekmett / placeholder
  todo and unimplemented, robustly implemented
  ☆33Updated 5 months ago
• re-xyr / speff
  Fast higher-order effect handlers with evidence passing
  ☆18Updated last year
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• ennocramer / monad-dijkstra
  Haskell monad transformer for weighted, non-deterministic computation
  ☆30Updated 3 weeks ago