Alternatives and similar repositories for metaocaml-bibliography:

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

• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• metaocaml / ber-metaocaml
  Unofficial git mirror of the BER MetaOCaml patchset.
  ☆65Updated last year
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆110Updated 4 years ago
• elpinal / modules
  Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules
  ☆31Updated 2 years ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 2 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆107Updated 2 years ago
• coq-community / parseque
  Total Parser Combinators in Coq [maintainer=@womeier]
  ☆42Updated last year
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆79Updated 11 years ago
• jyp / prettiest
  The Prettiest Printer
  ☆35Updated last year
• garrigue / certint
  A Certified Interpreter for ML with Structural Polymorphism
  ☆43Updated 2 years ago
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆53Updated 2 weeks ago
• lpw25 / girards-paradox
  A "implementation" of Girard's paradox in OCaml
  ☆105Updated 9 years ago
• willtim / row-polymorphism
  Example row-polymorphism implementations
  ☆61Updated last year
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 5 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆54Updated 3 years ago
• bitonic / tog
  ☆26Updated 8 years ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆45Updated 5 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆34Updated last week
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆34Updated 5 years ago
• TheoWinterhalter / formal-type-theory
  Formalising Type Theory in a modular way for translations between type theories
  ☆90Updated 7 years ago
• sweirich / replib
  Replib: generic programming & Unbound: generic treatment of binders
  ☆44Updated 2 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆76Updated 11 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆124Updated 10 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 7 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆47Updated 2 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 2 years ago
• agda / agda-ocaml
  OCaml backend for Agda
  ☆39Updated 6 years ago
• frex-project / idris-frex
  ☆47Updated 2 months ago
• OPLSS / oplss-notes-2018
  Notes and handouts from OPLSS 2018
  ☆53Updated 6 years ago