Alternatives and similar repositories for math:

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

• paolobrasolin / krater
  Template to effortlessly build math-rich websites
  ☆39Updated 3 years ago
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated 6 months ago
• favonia / hdtt2020-notes
  ☆36Updated 3 years ago
• avigad / qpf
  Datatypes as quotients of polynomial functors
  ☆35Updated 4 years ago
• uemurax / morg
  Organize mathematical thoughts
  ☆19Updated last year
• bobatkey / agda-metric-reals
  ☆29Updated 2 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 9 months ago
• ice1000 / agda-mode
  Accessing Agda's interaction mode via command line & external tactic for Agda.
  ☆26Updated 4 years ago
• mortberg / gen-cart
  A Unifying Cartesian Cubical Set Model
  ☆35Updated 5 years ago
• ToposInstitute / polytt
  A type theory with native support for Polynomial Functors.
  ☆39Updated last year
• ualib / agda-algebras
  The Agda Universal Algebra Library (html docs available at the url below)
  ☆33Updated 3 months ago
• TOTBWF / agda-sgd
  Experiments in Synthetic Differential Geometry
  ☆16Updated 3 years ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆24Updated 4 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 5 years ago
• agda / agda-pkg
  apkg - package manager for Agda
  ☆37Updated 3 years ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 5 months ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• wilbowma / dissertation
  The source for "Compiling with Dependent Types" (my dissertation)
  ☆30Updated 2 years ago
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆74Updated 4 months ago
• Chaaaos / formaltt
  Formalization of type theory
  ☆22Updated 3 years ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated last year
• jonsterling / coq-guarded-computational-type-theory
  ☆21Updated 6 years ago
• kangxyz / cubical-classics
  An attempt towards univalent classical mathematics in Cubical Agda.
  ☆29Updated last year
• cedille / ial
  The Iowa Agda Library
  ☆47Updated 3 months ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆41Updated 4 years ago
• ayberkt / sequents
  Proof search for intuitionistic propositional logic using Dyckhoff's LJT.
  ☆26Updated last year
• Trebor-Huang / Down-The-Path
  Spartan implementation of H.O.T.T.
  ☆25Updated 2 years ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆35Updated last year
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• 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