Alternatives and similar repositories for oplss-notes-2021

Users that are interested in oplss-notes-2021 are comparing it to the libraries listed below

• CoqHott / logrel-coq
  Logical Relation for MLTT in Coq
  ☆25Updated last week
• TyGuS / hoogle_plus
  Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)
  ☆60Updated 2 years ago
• Beluga-lang / McTT
  A bottom-up approach to a verified implementation of MLTT
  ☆20Updated this week
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• foreverbell / verified
  Coq formalizations and proofs of (data) structures and algorithms.
  ☆46Updated 7 years ago
• FrozenWinters / SbE
  An extension of the NbE algorithm to produce computational traces
  ☆22Updated 3 years ago
• yiyunliu / mltt-consistency
  Logical relation for predicative CC omega with booleans and an intensional identity type
  ☆13Updated last month
• julesjacobs / cgraphs
  Deadlock freedom by type checking
  ☆20Updated 2 years ago
• maxsnew / grammars-and-semantic-actions
  Intrinsic Verification of Formal Grammar Theory
  ☆22Updated 2 weeks ago
• vellvm / ctrees
  An itree-like data-structure to additionally support internal non-determinism
  ☆17Updated 2 months ago
• rocq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆59Updated 8 months ago
• OPLSS / oplss-notes-2019
  Notes and handouts from OPLSS 2019
  ☆34Updated 5 years ago
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆54Updated 8 months ago
• ybertot / plugin_tutorials
  A collection of small projects to illustrate how to write plugins for Coq
  ☆21Updated 6 years ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• vrahli / NuprlInCoq
  Implementation of Nuprl's type theory in Coq
  ☆45Updated 6 months ago
• L-TChen / ModalTypeTheory
  ☆21Updated 3 years ago
• jwiegley / coq-lattice
  A reflection-based proof tactic for lattices in Coq
  ☆22Updated last year
• smtcoq / sniper
  ☆36Updated 2 months ago
• Mtac2 / Mtac2
  ☆55Updated 2 months ago
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆55Updated 2 years ago
• uwplse / PUMPKIN-PATCH
  Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker
  ☆51Updated 10 months ago
• avigad / qpf
  Datatypes as quotients of polynomial functors
  ☆35Updated 5 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆30Updated last month
• plclub / metalib
  The Penn Locally Nameless Metatheory Library
  ☆74Updated 2 months ago
• verse-lab / lean-ssr
  LeanSSR: an SSReflect-Like Tactic Language for Lean
  ☆35Updated this week
• appliedfm / vstyle
  A style guide for Coq
  ☆18Updated 3 years ago
• uwplse / CoqAST
  Fun plugin to play with the Gallina AST.
  ☆38Updated 5 years ago
• plclub / lngen
  Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott
  ☆32Updated 7 months ago
• plum-umd / cgc
  Constructive Galois connections
  ☆32Updated 7 years ago