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.
  ☆82Updated this week
• felixwellen / synthetic-geometry
  Synthetic geometry. Probably mostly algebraic geometry.
  ☆23Updated last year
• b-mehta / topos
  Topos theory in lean
  ☆59Updated 4 years ago
• uds-psl / coq-library-complexity
  ☆31Updated last year
• LocalCharts / silviculture
  ☆16Updated 10 months ago
• jonsterling / latex-dieudonne
  A LaTeX package to reproduce (an enhanced version of) the numbered paragraph style from classic French mathematics books.
  ☆19Updated 3 years ago
• T-Brick / molasses
  MLB support for CM (the SML/NJ Compilation and Library Manager)
  ☆18Updated last year
• kentookura / forester.nvim
  Neovim plugin for forester
  ☆16Updated 4 months ago
• avigad / qpf
  Datatypes as quotients of polynomial functors
  ☆35Updated 4 years ago
• forked-from-1kasper / ground_zero
  Ground Zero: Lean 4 HoTT Library
  ☆57Updated this week
• tomdjong / MGS-domain-theory
  Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…
  ☆44Updated last year
• diracdeltafunk / SmallCategories
  A database of small finite categories
  ☆14Updated last year
• Lysxia / coq-simple-io
  IO for Gallina
  ☆32Updated last month
• kangxyz / cubical-classics
  An attempt towards univalent classical mathematics in Cubical Agda.
  ☆29Updated last year
• felixwellen / synthetic-zariski
  Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos
  ☆58Updated this week
• avigad / arwm
  Automated Reasoning for the Working Mathematician
  ☆11Updated 5 years ago
• uemurax / morg
  Organize mathematical thoughts
  ☆20Updated last year
• ToposInstitute / polytt
  A type theory with native support for Polynomial Functors.
  ☆39Updated last year
• mikeshulman / ohtt
  H.O.T.T. using rewriting in Agda
  ☆41Updated 2 years ago
• 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…
  ☆27Updated 2 years ago
• peterlefanulumsdaine / general-type-theories
  A (formalised) general definition of type theories
  ☆57Updated 3 years ago
• awodey / CatLogNotes
  Categorical Logic Notes
  ☆78Updated 3 years ago
• mikeshulman / basictex
  My basic LaTeX macros and BibTeX file.
  ☆13Updated 2 years ago
• nomeata / lean-calcify
  ☆30Updated last month
• madvorak / lean3-tactic-lean4
  Reference sheet for people who know Lean 3 and want to write tactic-based proofs in Lean 4
  ☆27Updated 5 months ago
• rzk-lang / sHoTT
  Formalisations for simplicial HoTT and synthetic ∞-categories.
  ☆48Updated 6 months ago
• coq-tactician / coq-tactician
  A Seamless, Interactive Tactic Learner and Prover for Coq
  ☆64Updated this week
• CMU-HoTT / serre-finiteness
  ☆15Updated last month
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated 6 months ago
• peterlefanulumsdaine / palmgren-archive
  Research material of Erik Palmgren (1963–2019)
  ☆20Updated last week