Alternatives and similar repositories for topologygame

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

• Chaaaos / formaltt
  Formalization of type theory
  ☆22Updated 4 years ago
• LAC1213 / compact_unit_ball
  Lean proof that a normed vector space with compact unit ball is finite dimensional
  ☆11Updated 5 years ago
• llee454 / functional-algebra
  This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…
  ☆28Updated 6 years ago
• gebner / trepplein
  Lean type-checker written in Scala.
  ☆36Updated 3 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…
  ☆28Updated 2 years ago
• rzk-lang / sHoTT
  Formalisations for simplicial HoTT and synthetic ∞-categories.
  ☆50Updated 2 months ago
• sweirich / graded-haskell
  Graded Dependent Type systems
  ☆25Updated 2 years ago
• b-mehta / combinatorics
  ☆23Updated 3 years ago
• mb64 / simple-lambda-prolog
  A simple λProlog interpreter
  ☆20Updated 3 years ago
• astump / cedille-core-spec
  Specification of the Cedille Core language
  ☆32Updated 5 years ago
• leanprover-community / con-nf
  A formal consistency proof of Quine's set theory New Foundations
  ☆73Updated 2 months ago
• crabbo-rave / Soup
  Extra and extended datatypes for Lean 4
  ☆11Updated 2 years ago
• leanprover / functional_programming_in_lean
  A book about functional programming in Lean
  ☆42Updated last year
• rocq-community / apery
  A formal proof of the irrationality of zeta(3), the Apéry constant [maintainer=@amahboubi,@pi8027]
  ☆25Updated last week
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated 11 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
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• rzk-lang / hottbook
  HoTT Book formalisations in Rzk.
  ☆19Updated last year
• Deducteam / Logipedia
  An encyclopedia of proofs
  ☆62Updated 9 months ago
• pis147879 / PELCR
  Parallel Environment for optimal Lambda Calculus Reduction
  ☆28Updated 3 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆40Updated 4 years ago
• maxdore / elfe
  Interactive Theorem Proving for students
  ☆20Updated 2 years ago
• meta-logic / lltp
  TPTP linear logic version
  ☆14Updated 7 months ago
• thamugadi / call-cc-krivine
  A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.
  ☆15Updated last year
• PatrickMassot / lean-verbose
  Very controlled natural language tactics for Lean
  ☆64Updated last year
• kangxyz / cubical-classics
  An attempt towards univalent classical mathematics in Cubical Agda.
  ☆31Updated last year
• jpt4 / skio
  Pure relational SKI combinator calculus interpreter.
  ☆11Updated 8 years ago
• ToposInstitute / polytt
  A type theory with native support for Polynomial Functors.
  ☆39Updated last year
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆22Updated 4 months ago
• mortberg / gen-cart
  A Unifying Cartesian Cubical Set Model
  ☆34Updated 5 years ago