Alternatives and similar repositories for agda-finite-prover

Users that are interested in agda-finite-prover are comparing it to the libraries listed below

• jespercockx / agda-core
  A work-in-progress core language for Agda, in Agda
  ☆55Updated last month
• AndrasKovacs / 2ltt-impl
  Eventually a practical 2-level TT-based compiler
  ☆27Updated last week
• frex-project / idris-frex
  ☆48Updated 2 months ago
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆55Updated 2 years ago
• AndrasKovacs / antifunext
  antifunext
  ☆34Updated last year
• agda / agda-stdlib-meta
  Meta-programming utilities for Agda.
  ☆19Updated this week
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆63Updated 3 years ago
• algebraic-graphs / agda
  The theory of algebraic graphs formalised in Agda
  ☆90Updated 7 years ago
• flupe / generics
  ☆23Updated last year
• andrejbauer / notes-on-realizability
  Lecture notes on realizability
  ☆74Updated 5 months ago
• jespercockx / ataca
  A TACtic library for Agda
  ☆49Updated 10 months ago
• bobatkey / agda-metric-reals
  ☆29Updated 3 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆53Updated last month
• maxsnew / cubical-categorical-logic
  Extensions to cubical for categorical logic/type theory
  ☆30Updated this week
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆119Updated 2 months ago
• guillaumebrunerie / initiality
  A formalized proof of a version of the initiality conjecture
  ☆43Updated 4 years ago
• wenkokke / schmitty
  Agda bindings to SMT-LIB2 compatible solvers.
  ☆101Updated 10 months ago
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆60Updated last month
• alhassy / gentle-intro-to-reflection
  A slow-paced introduction to reflection in Agda. ---Tactics!
  ☆103Updated 3 years ago
• oisdk / agda-ring-solver
  A fast, easy-to-use ring solver for agda with step-by-step solutions
  ☆40Updated 3 years ago
• lambdageek / unbound-generics
  Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)
  ☆56Updated last year
• gallais / potpourri
  Where my everyday research happens
  ☆54Updated last month
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆75Updated last week
• pigworker / TypesWhoSayNi
  being the materials for a paper I have in mind to write about the bidirectional discipline
  ☆52Updated 2 weeks ago
• gallais / agdarsec
  Total Parser Combinators in Agda
  ☆132Updated this week
• TOTBWF / refinery
  ⛏️ A refinement proof framework for haskell
  ☆70Updated 2 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆35Updated 4 months ago
• morphismtech / distributors
  Distributors - Unifying Parsers, Printers & Grammars
  ☆25Updated this week
• conal / paper-2021-language-derivatives
  Paper and talk
  ☆54Updated 2 years ago