Alternatives and similar repositories for prob-school

Users that are interested in prob-school are comparing it to the libraries listed below

• jtobin / measurable
  An embedded DSL for creating, composing, and using probability measures.
  ☆40Updated 5 years ago
• andrejbauer / mathematical-stories
  Mathematical stories
  ☆13Updated 4 years ago
• sweirich / graded-haskell
  Graded Dependent Type systems
  ☆24Updated 2 years ago
• mikeshulman / cohesivett
  Cohesive type theory
  ☆19Updated 3 years ago
• fsestini / zsyntax
  Automated theorem prover for a linear logic-based calculus for molecular biology.
  ☆12Updated 2 years ago
• mietek / formal-logic
  TODO
  ☆23Updated 9 years ago
• gstew5 / games
  ☆10Updated 5 years ago
• andreasabel / proposal-agda-tutorial
  Proposal for an Agda tutorial
  ☆11Updated 6 years ago
• lambdabetaeta / modal-logics
  Agda formalisation of dual-context constructive modal logics.
  ☆20Updated 5 years ago
• jwiegley / coq-cds4ltl
  A formalization of finite, constructive log analysis using linear temporal logic
  ☆22Updated last month
• patrickt / tactics
  Deep-embedded combinators for strategic rewriting.
  ☆15Updated 3 years ago
• arrayfire / arrayfire-haskell
  Haskell bindings to ArrayFire
  ☆60Updated 7 months ago
• ocramz / taco-hs
  Haskell port of the Tensor Algebra COmpiler
  ☆16Updated 5 years ago
• letmaik / monadiccp
  Monadic Constraint Programming framework
  ☆28Updated 7 years ago
• japesinator / Idris-Profunctors
  A small profunctor library for idris
  ☆17Updated 2 years ago
• brunjlar / protop
  topos programming
  ☆31Updated 6 years ago
• iblech / scheme-theory-in-agda
  A formalization of synthetic algebraic geometry in Agda
  ☆14Updated 6 years ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 7 years ago
• identicalsnowflake / cantor-pairing
  Convert data to and from a natural number representation
  ☆14Updated 4 years ago
• MatthewDaggitt / agda-routing
  An Agda library for reasoning about asynchronous iterative algorithms and network routing problems
  ☆27Updated last year
• rocq-community / regexp-Brzozowski
  Coq formalization of decision procedures for regular expression equivalence [maintainer=@anton-trunov]
  ☆13Updated 11 months ago
• mikeshulman / dirtt
  Directed type theory for formal category theory
  ☆17Updated 8 years ago
• gergoerdi / tandoori
  Compositional type checking for Haskell
  ☆37Updated 14 years ago
• twanvl / simple-reflect
  Simple reflection of expressions
  ☆33Updated 4 years ago
• nick8325 / equinox
  Paradox model finder and equinox theorem prover for first-order logic.
  ☆20Updated last year
• konn / equational-reasoning-in-haskell
  Agda-style equational reasoning in Haskell
  ☆53Updated 3 months ago
• langston-barrett / coq-big-o
  A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.
  ☆35Updated 8 years ago
• jmchapman / TT-in-TT
  Type theory in type theory
  ☆16Updated 13 years ago
• dpiponi / provability
  Some tools for provability logic
  ☆37Updated 7 years ago
• bolt12 / laop
  Linear Algebra of Programming - Algebraic Matrices in Haskell
  ☆84Updated 2 months ago