Alternatives and similar repositories for coq-lean-cheatsheet

Users that are interested in coq-lean-cheatsheet are comparing it to the libraries listed below

• TheoWinterhalter / formal-type-theory
  Formalising Type Theory in a modular way for translations between type theories
  ☆95Updated 7 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆62Updated 6 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆55Updated 3 months ago
• gebner / hott3
  HoTT in Lean 3
  ☆82Updated 5 years ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆74Updated 6 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆113Updated 5 months ago
• dlicata335 / hott-agda
  ☆84Updated 8 years ago
• conal / paper-2021-language-derivatives
  Paper and talk
  ☆55Updated 2 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆79Updated 3 months ago
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆77Updated 3 years ago
• felixwellen / DCHoTT-Agda
  Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality
  ☆56Updated 3 years ago
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆58Updated 3 weeks ago
• rocq-community / parseque
  Total Parser Combinators in Coq [maintainer=@womeier]
  ☆47Updated 5 months ago
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 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
• sweirich / replib
  Replib: generic programming & Unbound: generic treatment of binders
  ☆46Updated 3 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 5 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆84Updated 4 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆82Updated 2 months ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• abooij / wiwikwlhott
  What I wish I knew when learning HoTT
  ☆53Updated 6 years ago
• pi8027 / lambda-calculus
  A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2
  ☆86Updated 5 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆55Updated last month
• pigworker / TypesWhoSayNi
  being the materials for a paper I have in mind to write about the bidirectional discipline
  ☆53Updated 4 months ago
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆65Updated 3 years ago
• fredefox / cat
  A formalization of category theory in cubical Agda
  ☆59Updated 5 years ago
• scmu / aopa
  Algebra of Programming in Agda: Dependent Types for Relational Program Derivation
  ☆84Updated 9 years ago