Alternatives and similar repositories for verse-coq

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

• michaelsproul / dblib-linear
  Formalisation of the linear lambda calculus in Coq
  ☆10Updated 7 years ago
• effectfully / OTT
  Observational Type Theory as an Agda library
  ☆56Updated 8 years ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 7 years ago
• laMudri / quantitative
  ☆16Updated 3 years ago
• lthms / FreeSpec
  A framework for implementing and certifying impure computations in Coq
  ☆53Updated last year
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• gallais / agda-nbe
  Formalizing nbe in agda
  ☆32Updated 13 years ago
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 6 years ago
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆27Updated 5 months ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• jonsterling / constructive-sheaf-semantics
  I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.
  ☆17Updated 10 years ago
• danelahman / Normalization-By-Evaluation
  Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories
  ☆15Updated 2 months ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 4 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 6 months ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆36Updated 6 years ago
• pi8027 / efficient-finfun
  ☆13Updated 6 years ago
• AndrasKovacs / preordertt
  Experiments with preordered set models of (directed) type theories
  ☆15Updated 6 years ago
• gmalecha / template-coq
  Reflection library for Coq
  ☆12Updated 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
• CoqHott / Program-translations-CC-omega
  ☆14Updated 9 years ago
• jwiegley / coq-lattice
  A reflection-based proof tactic for lattices in Coq
  ☆21Updated 2 years ago
• bobatkey / system-f-parametricity-model
  A Model of Relationally Parametric System F in Coq
  ☆22Updated 10 years ago
• effectfully / Cubes
  A dependently typed type checker for a TT with intervals
  ☆23Updated 5 years ago
• laMudri / generic-lr
  AACMM's generic-syntax, but with QTT-style annotations
  ☆21Updated last year
• ahmadsalim / desc-n-crunch
  Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.
  ☆11Updated 6 years ago
• anuyts / menkar
  The multimode presheaf proof-assistant
  ☆37Updated 2 years ago
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆22Updated 5 years ago
• andreasabel / ipl
  Agda formalization of Intuitionistic Propositional Logic
  ☆22Updated last month
• lambdabetaeta / modal-logics
  Agda formalisation of dual-context constructive modal logics.
  ☆20Updated 5 years ago
• jonsterling / coq-domains
  ☆18Updated 3 years ago