Alternatives and similar repositories for coq-lean-cheatsheet

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

• gebner / trepplein
  Lean type-checker written in Scala.
  ☆40Updated 3 years ago
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆76Updated 6 months ago
• marcusrossel / verified-compiler
  A toy example of a verified compiler.
  ☆30Updated 6 months ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆58Updated last year
• HarrisonGrodin / agda-calf
  A cost-aware logical framework, embedded in Agda.
  ☆67Updated last week
• Blaisorblade / dot-iris
  Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization
  ☆36Updated 2 months ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆63Updated 4 months ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆72Updated 9 months ago
• emilyriehl / yoneda
  comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories
  ☆71Updated last year
• mtt-lang / mtt-lang
  A toy functional language based on modal type theory. Try it online: https://mtt-lang.github.io/mtt-web
  ☆46Updated 3 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆78Updated 2 months ago
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆58Updated 7 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
• math-comp / hierarchy-builder
  High level commands to declare a hierarchy based on packed classes
  ☆103Updated 2 weeks ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆36Updated 3 months ago
• RedPRL / mugen
  ♾️ A library for universe levels and universe polymorphism
  ☆35Updated 3 months ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• avigad / qpf
  Datatypes as quotients of polynomial functors
  ☆36Updated 5 years ago
• andrejbauer / notes-on-realizability
  Lecture notes on realizability
  ☆74Updated 8 months ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated 2 years ago
• argumentcomputer / LSpec
  A Testing Framework for Lean
  ☆64Updated 2 weeks ago
• andrejbauer / faux-type-theory
  ☆45Updated 2 months ago
• ajrouvoet / ternary.agda
  An Agda library for programming with ternary relations
  ☆18Updated 7 months ago
• verse-lab / lean-ssr
  LeanSSR: an SSReflect-Like Tactic Language for Lean
  ☆39Updated 3 weeks ago
• conal / paper-2021-language-derivatives
  Paper and talk
  ☆55Updated 2 years ago
• ayberkt / formal-topology-in-UF
  Formal Topology in Univalent Foundations (WIP).
  ☆36Updated 3 years ago
• Beluga-lang / McTT
  Building A Correct-By-Construction Proof Checkers For Type Theories
  ☆29Updated this week
• siddhartha-gadgil / Saturn
  Experiments with SAT solvers with proofs in Lean 4
  ☆62Updated last year
• LPCIC / coq-elpi
  Coq plugin embedding elpi
  ☆177Updated last week
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago