Alternatives and similar repositories for presentations

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

• kckennylau / mathlib4
  Unofficial repository for the experimental porting of mathlib into lean4
  ☆10Updated 4 years ago
• uds-psl / coq-library-complexity
  ☆31Updated last year
• opencompl / lean-gap
  An embedding and formalization of GAP (groups, algorithms, Programming) in LEAN4
  ☆15Updated 3 years ago
• rocq-community / bits
  A formalization of bitset operations in Coq and the corresponding axiomatization and extraction to OCaml native integers [maintainer=@ant…
  ☆23Updated last month
• Lysxia / coq-ceres
  Coq library for serialization to S-expressions
  ☆19Updated last year
• b-mehta / combinatorics
  ☆23Updated 3 years ago
• rocq-community / atbr
  Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]
  ☆23Updated 7 months ago
• herbie-fp / egg-herbie
  An interface for using mwillsey/egg with math simplification.
  ☆13Updated last year
• lamdu / lamdu-calculus
  An extended typed Lambda Calculus
  ☆21Updated 10 months ago
• leanprover / super
  Superposition prover
  ☆17Updated 2 years ago
• peterlefanulumsdaine / Oberwolfach-explorations
  collaboration on work in progress
  ☆15Updated 14 years ago
• annenkov / two-level
  Two-Level Type Theory
  ☆28Updated 5 years ago
• arthuraa / memory-safe-language
  A formalization of properties of a simple imperative, memory-safe language.
  ☆19Updated 3 years ago
• iblech / scheme-theory-in-agda
  A formalization of synthetic algebraic geometry in Agda
  ☆14Updated 6 years ago
• sweirich / graded-haskell
  Graded Dependent Type systems
  ☆24Updated last year
• Deducteam / SizeChangeTool
  A termination checker for higher-order rewriting with dependent types
  ☆10Updated 5 years ago
• peterlefanulumsdaine / cartmell-thesis
  HoTT group project to TeXify Cartmell's PhD thesis “Generalised Algebraic Theories and Contextual Categories”
  ☆15Updated 2 years ago
• mit-frap / spring20
  Problem Sets for MIT 6.822 Formal Reasoning About Programs, Spring 2020
  ☆19Updated 5 years ago
• Chaaaos / formaltt
  Formalization of type theory
  ☆22Updated 3 years ago
• Deducteam / Logipedia
  An encyclopedia of proofs
  ☆60Updated 6 months ago
• ocramz / taco-hs
  Haskell port of the Tensor Algebra COmpiler
  ☆16Updated 5 years ago
• siraben / coq-wigderson
  Formalization of Wigderson's graph coloring algorithm in Coq
  ☆9Updated last year
• ice1000 / agda-mode
  Accessing Agda's interaction mode via command line & external tactic for Agda.
  ☆26Updated 4 years ago
• andrejbauer / partial-combinatory-algebras
  A Lean 4 formalization of partial combinatory algebras.
  ☆14Updated 5 months ago
• rowandavies / sml-cidre
  SML Checker for Intersection and Datasort Refinements (pronounced "cider")
  ☆20Updated 11 years ago
• agda / package-index
  A package Index for agda libraries
  ☆12Updated 4 years ago
• avigad / arwm
  Automated Reasoning for the Working Mathematician
  ☆11Updated 5 years ago
• math-comp / multinomials
  Multinomials for the Mathematical Components library.
  ☆14Updated last month
• mgrabovsky / fm-notes
  Unassorted scribbles on formal methods, type theory, category theory, and so on, and so on
  ☆22Updated last year
• andrejbauer / mathematical-stories
  Mathematical stories
  ☆13Updated 4 years ago