Alternatives and similar repositories for Constructors:

Users that are interested in Constructors are comparing it to the libraries listed below

• tchajed / coq-ltac2-experiments
  All the code I've ever written in Ltac2
  ☆11Updated 4 years ago
• lpw25 / shifted-names
  Coq library for handling names
  ☆19Updated 2 years ago
• pi8027 / efficient-finfun
  ☆13Updated 5 years ago
• pigworker / EGTBS
  being the introduction to co-de-Bruijn metasyntax
  ☆23Updated 2 years ago
• thery / T2048
  a version of the 2048 game for Coq
  ☆22Updated last year
• 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
• mietek / imla2017
  Agda formalisation of NbE for λ□
  ☆18Updated 7 years ago
• thery / PolTac
  Tactic for polynomial manipulations
  ☆10Updated last year
• gmalecha / coq-printf
  Implementation of sprintf for Coq
  ☆18Updated 4 years ago
• 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
• sstucki / pts-agda
  A formalization of Pure Type Systems (PTS) in Agda
  ☆23Updated last month
• gallais / type-scope-semantics
  A self-contained repository for the paper Type and Scope Preserving Semantics
  ☆22Updated 6 years ago
• gallais / agda-nbe
  Formalizing nbe in agda
  ☆30Updated 12 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
• RedPRL / sml-dependent-lcf
  A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!
  ☆16Updated 7 years ago
• yforster / coq-verified-extraction
  ☆13Updated 6 months ago
• SimonBoulier / TypingFlags
  A Coq plugin to disable positivity check, guard check and termination check
  ☆16Updated 5 years ago
• bedrocksystems / coq-lens
  Lenses in Coq
  ☆17Updated 2 years ago
• flupe / generics
  ☆23Updated 8 months ago
• nachivpn / nbe-course
  NbE course @ Chalmers
  ☆28Updated 5 months ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 6 years ago
• roglo / banach_tarski
  Formal proof in Coq of Banach-Tarski paradox.
  ☆15Updated 5 months ago
• bch29 / agda-holes
  Agda programming with holes
  ☆27Updated 4 years ago
• pigworker / Gigs-Summer-2018
  what I did on my holidays
  ☆12Updated 6 years ago
• 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…
  ☆31Updated 7 months ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago
• shinji-kono / zf-in-agda
  define ZF Set Theory in Agda and it's model on Ordinal and Ordinal Definable Set
  ☆14Updated last month
• uds-psl / autosubst-ocaml
  ☆13Updated last month
• pcapriotti / agda-categories
  Category theory and algebra
  ☆28Updated 8 years ago
• jwiegley / coq-lattice
  A reflection-based proof tactic for lattices in Coq
  ☆20Updated last year