Alternatives and similar repositories for hott-species

Users that are interested in hott-species are comparing it to the libraries listed below

• tuura / selective-theory-coq
  Selective applicative functors laws and theorems
  ☆14Updated 5 years ago
• nbenton / coqdomains
  Domain theory and denotational semantics in Coq
  ☆10Updated 10 years ago
• mikeshulman / dirtt
  Directed type theory for formal category theory
  ☆17Updated 8 years ago
• uwplse / CoqAST
  Fun plugin to play with the Gallina AST.
  ☆38Updated 5 years ago
• jespercockx / reflection-tutorial
  ☆17Updated 6 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• smimram / strid
  A string diagram generator for LaTeX.
  ☆30Updated 2 years ago
• andreasabel / ipl
  Agda formalization of Intuitionistic Propositional Logic
  ☆22Updated 2 months ago
• bmsherman / topology
  Formal topology (and some probability) in Coq
  ☆32Updated 6 years ago
• jwiegley / coq-lattice
  A reflection-based proof tactic for lattices in Coq
  ☆22Updated last year
• OPLSS / oplss-notes-2017
  handouts and notes from the 2017 edition of the summer school
  ☆39Updated 8 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆35Updated 4 years ago
• david-christiansen / epigram1
  A version of Epigram 1 that can run with newer GHCs
  ☆53Updated 8 years ago
• jonsterling / coq-guarded-computational-type-theory
  ☆21Updated 7 years ago
• gmalecha / coq-ltac-iter
  Access hint databases from tactics.
  ☆12Updated 5 years ago
• gmalecha / template-coq
  Reflection library for Coq
  ☆12Updated 5 years ago
• coq-io / system
  Library of Unix effects for Coq.
  ☆22Updated 5 years ago
• agda / ooAgda
  Interactive and object-oriented programming in Agda using coinductive types
  ☆23Updated 2 months ago
• letouzey / coq-minicalc
  Toy demo of lexing/parsing in Coq
  ☆12Updated 6 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• gmalecha / coq-interaction-trees
  Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.
  ☆18Updated 7 years ago
• mietek / research
  Work in progress
  ☆38Updated 2 months ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 3 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 2 months ago
• ichistmeinname / free-proving
  Resources for "One Monad to Prove Them All"
  ☆29Updated 6 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆21Updated 6 years ago
• MatthewDaggitt / agda-routing
  An Agda library for reasoning about asynchronous iterative algorithms and network routing problems
  ☆28Updated last year
• pcapriotti / agda-categories
  Category theory and algebra
  ☆27Updated 9 years ago
• gallais / agda-nbe
  Formalizing nbe in agda
  ☆31Updated 12 years ago
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆26Updated 4 years ago