Alternatives and similar repositories for peppermint-prover:

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

• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated 10 months ago
• frex-project / idris-frex
  ☆47Updated 5 months ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆34Updated 4 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 3 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• effectfully / Generic
  A library for doing generic programming in Agda
  ☆31Updated 4 years ago
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆22Updated 5 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• frex-project / agda-fragment
  Algebraic proof discovery in Agda
  ☆33Updated 3 years ago
• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆52Updated 7 years ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆50Updated 4 months ago
• andreasabel / helf
  Haskell implementation of the Edinburgh Logical Framework
  ☆27Updated 6 months ago
• flupe / generics
  ☆23Updated 10 months ago
• andorp / mini-grin
  ICFP tutorial
  ☆39Updated 3 years ago
• jespercockx / ataca
  A TACtic library for Agda
  ☆48Updated 7 months ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆56Updated 4 years ago
• ice1000 / agda-mode
  Accessing Agda's interaction mode via command line & external tactic for Agda.
  ☆26Updated 4 years ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆50Updated 3 years ago
• danelahman / haskell-coop
  An experimental Haskell library for programming with effectful runners.
  ☆29Updated 5 years ago
• mortberg / gen-cart
  A Unifying Cartesian Cubical Set Model
  ☆35Updated 5 years ago
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆45Updated 2 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆34Updated last month
• logsem / mitten_preorder
  ☆29Updated 2 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆29Updated 6 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• LightAndLight / cbpv
  A usable type system for call by push-value
  ☆33Updated 5 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆34Updated 5 years ago