Alternatives and similar repositories for provability

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

• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆51Updated 7 years ago
• jyp / nano-Agda
  Tiny type-checker with dependent types
  ☆78Updated 11 years ago
• konn / equational-reasoning-in-haskell
  Agda-style equational reasoning in Haskell
  ☆54Updated 4 months ago
• ericfinster / opetopic
  Web based opetopic editor
  ☆35Updated 10 months ago
• gergoerdi / tandoori
  Compositional type checking for Haskell
  ☆37Updated 14 years ago
• jwiegley / coq-cds4ltl
  A formal verification of Linear Temporal Logic in Coq
  ☆22Updated this week
• LightAndLight / cbpv
  A usable type system for call by push-value
  ☆33Updated 5 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆40Updated 4 years ago
• brunjlar / protop
  topos programming
  ☆31Updated 6 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 4 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years 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
• gallais / generic-syntax
  A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs
  ☆75Updated 3 years ago
• m0ar / lollipop
  A general purpose programming language with linear types
  ☆43Updated 8 years ago
• byorgey / enumeration
  Simple Haskell package for efficiently indexable finite and infinite enumerations.
  ☆12Updated 4 months ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 3 years ago
• xgrommx / agda-ecosystem
  ☆32Updated 7 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• Jaak / TinyOutsideIn
  Small implementation of OutsideIn(X) type checking algorithm
  ☆31Updated 10 years ago
• jonsterling / hs-abt
  Type safe abstract binding trees for Haskell, using Vinyl
  ☆16Updated 7 years ago
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated 8 months ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆35Updated 4 years ago
• gallais / potpourri
  Where my everyday research happens
  ☆55Updated 2 months ago
• vmchale / permutations
  Provides a type-safe way of working with permutations in Idris
  ☆36Updated 3 years ago
• mietek / research
  Work in progress
  ☆38Updated 2 months ago
• robrix / sequoia
  classical sequent calculus, embedded in Haskell
  ☆21Updated this week
• jozefg / miniprl
  A small implementation of a proof refinement logic.
  ☆50Updated 8 years ago
• jtobin / deanie
  An embedded probabilistic programming language.
  ☆34Updated 8 years ago
• Saizan / miller
  Miller/pattern unification in Agda
  ☆65Updated 11 years ago