Alternatives and similar repositories for coq-verified-extraction:

Users that are interested in coq-verified-extraction are comparing it to the libraries listed below

• yforster / coqtheorem
  A LaTeX package to make theorem names link to coqdoc webpages. Works with ntheorem, amsthm and the LLNCS and LIPIcs classes.
  ☆15Updated 5 years ago
• jwiegley / coq-lattice
  A reflection-based proof tactic for lattices in Coq
  ☆20Updated last year
• damien-pous / relation-algebra
  Relation algebra library for Coq
  ☆48Updated 2 months ago
• thery / T2048
  a version of the 2048 game for Coq
  ☆22Updated last year
• HuStmpHrrr / mech-type-theories
  Mechanizations of Type Theories
  ☆28Updated last month
• doctorn / agda-nbe
  Verified NbE via gluing in Agda
  ☆11Updated 8 months ago
• peterlefanulumsdaine / palmgren-archive
  Research material of Erik Palmgren (1963–2019)
  ☆20Updated last year
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago
• gmalecha / coq-printf
  Implementation of sprintf for Coq
  ☆18Updated 4 years ago
• ecranceMERCE / trakt
  A generic goal preprocessing tool for proof automation tactics in Coq
  ☆15Updated last month
• andreasabel / agda2lagda
  Simple conversion from Agda text to literate Agda text.
  ☆14Updated last month
• coq-community / coq-program-verification-template
  Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…
  ☆30Updated 6 months ago
• logsem / mitten_preorder
  ☆27Updated last year
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆34Updated 5 years ago
• jonsterling / agda-synthetic-domain-theory
  ☆17Updated 2 years ago
• flupe / generics
  ☆23Updated 6 months ago
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆49Updated 4 months ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• awswan / oraclemodality
  ☆13Updated 7 months ago
• proofengineering / proofengineering-bib
  BibTeX bibliographies for proof engineering-related papers
  ☆30Updated 5 years ago
• gmalecha / coq-interaction-trees
  Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.
  ☆17Updated 6 years ago
• lawcho / agda2c
  Agda to C compiler
  ☆10Updated last year
• SimonBoulier / TypingFlags
  A Coq plugin to disable positivity check, guard check and termination check
  ☆16Updated 5 years ago
• math-comp / mczify
  Micromega tactics for Mathematical Components
  ☆25Updated last month
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆23Updated 2 weeks ago
• rahulc29 / realizability
  Experiments with Realizability in Univalent Type Theory
  ☆17Updated 3 months ago
• thiagofelicissimo / BiTTs
  ☆23Updated 5 months ago
• FrozenWinters / SbE
  An extension of the NbE algorithm to produce computational traces
  ☆21Updated 2 years ago
• Armael / coq-procrastination
  A small Coq library for collecting side conditions and deferring their proof
  ☆24Updated 5 years ago