Alternatives and similar repositories for metaocaml-bibliography

Users that are interested in metaocaml-bibliography are comparing it to the libraries listed below

• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• metaocaml / ber-metaocaml
  Unofficial git mirror of the BER MetaOCaml patchset.
  ☆69Updated 6 months ago
• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆82Updated 4 years ago
• yallop / ocaml-asp
  Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc
  ☆102Updated 5 months ago
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆58Updated 7 months ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆112Updated 3 months ago
• abella-prover / abella
  An interactive theorem prover based on lambda-tree syntax
  ☆98Updated last month
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• dbp / funtal
  FunTAL: mixing a functional language with assembly.
  ☆40Updated 8 years ago
• slindley / effect-handlers
  ☆84Updated last year
• bobatkey / sott
  Simplified Observational Type Theory
  ☆85Updated 2 years ago
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆109Updated 10 years ago
• agda / agda-ocaml
  OCaml backend for Agda
  ☆39Updated 7 years ago
• yallop / fomega
  System Fω interpreter for use in Advanced Functional Programming course
  ☆66Updated 2 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆77Updated 3 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆49Updated 4 years ago
• jozefg / nbe-for-mltt
  Normalization by Evaluation for Martin-Löf Type Theory
  ☆129Updated last year
• andrejbauer / coop
  A prototype programming language for programming with runners
  ☆91Updated 4 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• TheoWinterhalter / formal-type-theory
  Formalising Type Theory in a modular way for translations between type theories
  ☆95Updated 7 years ago
• Ucombinator / parsing-with-zippers
  A clean implementation of Parsing with Zippers.
  ☆38Updated 7 years ago
• uwplse / CoqAST
  Fun plugin to play with the Gallina AST.
  ☆38Updated 6 years ago
• elpinal / modules
  Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules
  ☆31Updated 2 years ago
• RobertHarper / TILT-Compiler
  Standard ML compiler based on typed intermediate languages.
  ☆49Updated 11 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆82Updated 3 weeks ago
• pdarragh / parsing-with-zippers-paper-artifact
  The artifact associated with "Parsing with Zippers (Functional Pearl)" (Darragh and Adams) to appear in ICFP 2020.
  ☆29Updated last year
• rocq-community / parseque
  Total Parser Combinators in Coq [maintainer=@womeier]
  ☆46Updated 3 months ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆60Updated 6 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated 2 weeks ago