Alternatives and similar repositories for agda-ring-solver

Users that are interested in agda-ring-solver are comparing it to the libraries listed below

• pigworker / ProgrammerCommaCon
  being a collection of Agda-facilitated ramblings
  ☆33Updated 5 years ago
• mortberg / gen-cart
  A Unifying Cartesian Cubical Set Model
  ☆34Updated 5 years ago
• anuyts / menkar
  The multimode presheaf proof-assistant
  ☆36Updated 2 years ago
• jldodds / coq-lean-cheatsheet
  A quick reference for mapping Coq tactics to Lean tactics
  ☆72Updated 4 years ago
• conal / paper-2021-language-derivatives
  Paper and talk
  ☆54Updated 2 years ago
• emilyriehl / yoneda
  comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories
  ☆66Updated 8 months ago
• felixwellen / DCHoTT-Agda
  Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality
  ☆54Updated 3 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆35Updated 3 months ago
• effectfully / Generic
  A library for doing generic programming in Agda
  ☆32Updated 4 years ago
• abooij / wiwikwlhott
  What I wish I knew when learning HoTT
  ☆53Updated 6 years ago
• dlicata335 / hott-agda
  ☆84Updated 7 years ago
• xgrommx / agda-ecosystem
  ☆30Updated 7 years ago
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆54Updated 10 months ago
• bobatkey / agda-metric-reals
  ☆29Updated 3 years ago
• wenkokke / AutoInAgda
  Proof automation – for Agda, in Agda.
  ☆44Updated 4 years ago
• ayberkt / formal-topology-in-UF
  Formal Topology in Univalent Foundations (WIP).
  ☆36Updated 2 years ago
• ivanbakel / hout-prover
  A non-interactive proof assistant using the Haskell type system
  ☆37Updated 5 years ago
• algebraic-graphs / agda
  The theory of algebraic graphs formalised in Agda
  ☆90Updated 7 years ago
• Lysxia / profunctor-monad
  Bidirectional programming in Haskell with monadic profunctors
  ☆46Updated 3 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated last year
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• fredefox / cat
  A formalization of category theory in cubical Agda
  ☆60Updated 5 years ago
• guillaumebrunerie / initiality
  A formalized proof of a version of the initiality conjecture
  ☆41Updated 4 years ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 4 years ago
• nachivpn / nbe-course
  NbE course @ Chalmers
  ☆28Updated 9 months ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆81Updated 11 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• jaycech3n / Isabelle-HoTT
  An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle
  ☆34Updated 2 years ago
• konn / equational-reasoning-in-haskell
  Agda-style equational reasoning in Haskell
  ☆53Updated 3 months ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 4 years ago