Alternatives and similar repositories for ocaml-forester

Users that are interested in ocaml-forester are comparing it to the libraries listed below

• jonsterling / forest
  My mathematical Zettelkasten, created using forester. Moved to sourcehut.
  ☆88Updated 3 months ago
• jonsterling / latex-dieudonne
  A LaTeX package to reproduce (an enhanced version of) the numbered paragraph style from classic French mathematics books.
  ☆19Updated 4 years ago
• paolobrasolin / krater
  Template to effortlessly build math-rich websites
  ☆39Updated 3 years ago
• b-mehta / topos
  Topos theory in lean
  ☆63Updated 4 years ago
• LocalCharts / silviculture
  ☆16Updated last year
• ToposInstitute / polytt
  A type theory with native support for Polynomial Functors.
  ☆39Updated last year
• iblech / internal-methods
  Notes on how to use the internal language of toposes in algebraic geometry
  ☆59Updated this week
• jespercockx / agda-core
  A work-in-progress core language for Agda, in Agda
  ☆55Updated 2 weeks ago
• felixwellen / synthetic-geometry
  Synthetic geometry. Probably mostly algebraic geometry.
  ☆24Updated last year
• rzk-lang / sHoTT
  Formalisations for simplicial HoTT and synthetic ∞-categories.
  ☆51Updated 2 months ago
• andrejbauer / alg
  Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.
  ☆85Updated 4 years ago
• uds-psl / coq-library-complexity
  ☆31Updated 2 years ago
• rzrn / ground_zero
  Ground Zero: Lean 4 HoTT Library
  ☆66Updated 3 weeks ago
• varkor / tangle
  A modern string diagram editor for the web.
  ☆25Updated 4 months ago
• math-comp / hierarchy-builder
  High level commands to declare a hierarchy based on packed classes
  ☆101Updated this week
• awodey / CatLogNotes
  Categorical Logic Notes
  ☆80Updated 3 years ago
• felixwellen / synthetic-zariski
  Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos
  ☆63Updated last week
• iwilare / church-rosser
  A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…
  ☆28Updated 2 years ago
• emilyriehl / yoneda
  comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories
  ☆68Updated 10 months ago
• rocq-community / lemma-overloading
  Libraries demonstrating design patterns for programming and proving with canonical structures in Coq [maintainer=@anton-trunov]
  ☆28Updated 5 months ago
• tomdjong / MGS-categorical-realizability
  Lecture notes and exercises for the advanced course on Categorical Realizability at the Midlands Graduate School (MGS) 2024 and the Europ…
  ☆21Updated last month
• FlorianAdler / inftyCats
  ☆14Updated this week
• Lysxia / coq-simple-io
  IO for Gallina
  ☆33Updated 2 months ago
• kangxyz / cubical-classics
  An attempt towards univalent classical mathematics in Cubical Agda.
  ☆32Updated last year
• andrejbauer / formalized-mathematics-in-lean
  A graduate course on formalized mathematics at the Faculty of Mathematics and Physics, University of Ljubljana, Fall semester 2024/25
  ☆27Updated 8 months ago
• gebner / hott3
  HoTT in Lean 3
  ☆80Updated 5 years ago
• coq-tactician / coq-tactician
  A Seamless, Interactive Tactic Learner and Prover for Coq
  ☆74Updated last month
• Trebor-Huang / vscode-forester
  VSCode support for Forester
  ☆21Updated 3 months ago
• tlringer / proof-demos
  Repository where I'll collect some demos of proof assistants that I show to various people in order to spread the magic
  ☆38Updated 2 years ago
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆17Updated 3 weeks ago