Alternatives and similar repositories for menhir

Users that are interested in menhir are comparing it to the libraries listed below

• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• RedPRL / asai
  🩺 A library for compiler diagnostics
  ☆46Updated 4 months ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆36Updated last year
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated last year
• dunhamsteve / newt
  A toy dependent typed language.
  ☆29Updated 2 weeks ago
• rzrn / anders
  Anders: Cubical Type Checker
  ☆24Updated last year
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆36Updated 3 weeks ago
• samuela / bidirectional-typing
  A bidirectional type checker
  ☆63Updated 7 years ago
• matijapretnar / millet
  A ML-like pure functional language that can be used as a template for creating your own language
  ☆28Updated 4 months ago
• hazelgrove / diy-hazelnut
  A template for you to implement Hazelnut yourself
  ☆22Updated this week
• andreypopp / type-systems
  Playing with type systems
  ☆51Updated 5 months ago
• murmour / mparser
  A simple monadic parser combinator library for OCaml
  ☆67Updated 2 years ago
• ocaml-flambda / ocaml-jst
  OCaml plus Jane Street extensions
  ☆74Updated 10 months ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆69Updated 3 months ago
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆26Updated 3 years ago
• Julian / tree-sitter-lean
  Experimental tree-sitter parser for the Lean (4) Theorem Prover
  ☆34Updated 5 months ago
• edwinb / Yaffle
  A core language and API for dependently typed languages
  ☆94Updated 3 months ago
• eayus / sirdi
  Package manager for Idris
  ☆35Updated 2 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 6 years ago
• fpottier / pprint
  A pretty-printing combinator library for OCaml
  ☆51Updated 10 months ago
• RedPRL / algaeff
  🦠 Reusable components based on algebraic effects
  ☆50Updated 8 months ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆59Updated last year
• re-xyr / speff
  Fast higher-order effect handlers with evidence passing
  ☆21Updated last year
• Innf107 / vega-prototype
  Prototype for https://github.com/Innf107/vega
  ☆19Updated 10 months ago
• soren-n / bidi-higher-rank-poly
  Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…
  ☆22Updated 4 years ago
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated 8 months ago
• morphic-lang / morphic
  Pure functional programming with whole-program mutability inference
  ☆69Updated this week
• ocaml-multicore / meio
  Monitor Eio programs
  ☆78Updated last year
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆28Updated 2 years ago
• cedille / cedille2
  ☆15Updated 5 months ago