Alternatives and similar repositories for howtoproveacompiler

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

• andrejbauer / faux-type-theory
  ☆43Updated last month
• lexa-lang / lexa
  ☆39Updated 2 months ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆47Updated 5 years ago
• appliedfm / vstyle
  A style guide for Coq
  ☆18Updated 3 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated last week
• yallop / ocaml-flap
  A deterministic parser with fused lexing
  ☆73Updated 2 years ago
• pigworker / LEOG
  being an implementation of the calculus of constructions
  ☆17Updated 2 years ago
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆22Updated 6 months ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• Beluga-lang / McTT
  Building A Correct-By-Construction Proof Checkers For Type Theories
  ☆26Updated 3 weeks ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆49Updated 4 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated 2 years ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆78Updated 2 months ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆45Updated 3 years ago
• ionathanch / parapoly
  A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"
  ☆31Updated last year
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆58Updated 2 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• lpw25 / shifted-names
  Coq library for handling names
  ☆19Updated 3 years ago
• julesjacobs / cgraphs
  Deadlock freedom by type checking
  ☆20Updated 2 years ago
• RedPRL / mugen
  ♾️ A library for universe levels and universe polymorphism
  ☆35Updated 2 months ago
• umazalakain / typing-linear-pi
  Typing the linear pi calculus in Agda
  ☆29Updated 3 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years 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
• fblanqui / color
  Coq library on rewriting theory and termination
  ☆37Updated 2 months ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆62Updated 3 months ago
• hkust-taco / superf
  Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…
  ☆15Updated last year
• pamellies / lambda-calculus-and-categories
  A repository for the material of my course on lambda-calculus and categories
  ☆43Updated 4 years ago