Alternatives and similar repositories for left-recursion

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

• lexi-lambda / eff
  🚧 a work in progress effect system for Haskell 🚧
  ☆137Updated 2 years ago
• ollef / rock
  Build system
  ☆131Updated 2 months ago
• samuela / bidirectional-typing
  A bidirectional type checker
  ☆66Updated 8 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• TOTBWF / refinery
  ⛏️ A refinement proof framework for haskell
  ☆70Updated 2 years ago
• bkomuves / toy-language-server
  Example language server (LSP) implementation for a toy language
  ☆60Updated 4 years ago
• Innf107 / vega-prototype
  Prototype for https://github.com/Innf107/vega
  ☆19Updated last year
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆130Updated 3 months ago
• re-xyr / speff
  Fast higher-order effect handlers with evidence passing
  ☆21Updated 2 years ago
• Russoul / Idris2-Effect
  Experimental effects library for Idris 2
  ☆43Updated 3 years ago
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆61Updated 2 years ago
• ennocramer / monad-dijkstra
  Haskell monad transformer for weighted, non-deterministic computation
  ☆31Updated 11 months ago
• frizensami / haskell-optimization
  A beginner's guide to Haskell optimization
  ☆65Updated 8 years ago
• ice1000 / agda-mode
  Accessing Agda's interaction mode via command line & external tactic for Agda.
  ☆27Updated last month
• xnning / EvEff
  Efficient Haskell effect handlers based on evidence translation.
  ☆85Updated 4 years ago
• TOTBWF / tactic-haskell
  Tactic Metaprogramming in Haskell
  ☆56Updated 6 years ago
• frex-project / idris-frex
  ☆51Updated 4 months ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated 2 years ago
• Bodigrim / poly
  Fast polynomial arithmetic in Haskell (dense and sparse, univariate and multivariate, usual and Laurent)
  ☆69Updated 4 months ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated this week
• steshaw / lennart-lambda
  λλλλ Lennart Augustsson's λ-calculus cooked four ways
  ☆55Updated 8 years ago
• bollu / minitt
  bollu learns implementation of dependent typing
  ☆34Updated 2 years ago
• re-xyr / avail
  Low-overhead effect management for concrete monads
  ☆37Updated 3 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆85Updated 4 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆115Updated 5 months ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆54Updated 4 years ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆72Updated 10 months ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆62Updated 6 years ago
• maybetonyfu / chameleon
  A tool to make solving type errors in Haskell simple and fun.
  ☆38Updated 3 years ago
• stefan-hoeck / idris2-dom
  Javascript DOM bindings for Idris2
  ☆53Updated 2 months ago