Alternatives and similar repositories for coq-minicalc:

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

• gmalecha / coq-printf
  Implementation of sprintf for Coq
  ☆18Updated 4 years 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
  ☆16Updated 2 years ago
• thery / PolTac
  Tactic for polynomial manipulations
  ☆10Updated last year
• L-TChen / FiniteSets
  Fintie Sets in Cubical Agda
  ☆12Updated 5 years ago
• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 6 years ago
• jonsterling / coq-domains
  ☆18Updated 2 years ago
• michaelsproul / dblib-linear
  Formalisation of the linear lambda calculus in Coq
  ☆10Updated 6 years ago
• thery / T2048
  a version of the 2048 game for Coq
  ☆22Updated last year
• jespercockx / reflection-tutorial
  ☆17Updated 6 years ago
• andreasabel / strong-normalization
  Formalizations of strong normalization proofs
  ☆34Updated 5 years ago
• ayberkt / sml-system-t
  SML implementation of System T from PFPL.
  ☆11Updated 7 years ago
• andreasabel / ipl
  Agda formalization of Intuitionistic Propositional Logic
  ☆22Updated last year
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 2 years ago
• metaocaml / metaocaml-opam
  A repository of MetaOCaml packages
  ☆12Updated last year
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 4 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆33Updated 3 years ago
• nmvdw / Three-HITs
  All higher inductive types can be obtained from three simple HITs.
  ☆17Updated 6 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
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 5 years ago
• pi8027 / efficient-finfun
  ☆13Updated 5 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆34Updated 5 years ago
• L-TChen / MtacAR
  Mtac in Agda
  ☆28Updated 3 years ago
• andrejbauer / miniLCF
  A bare-bones LCF-style proof assistant
  ☆22Updated 5 years ago
• umazalakain / session-types-coq
  Formalising session types in Coq
  ☆17Updated 5 years ago
• ichistmeinname / free-proving
  Resources for "One Monad to Prove Them All"
  ☆29Updated 6 years ago
• wilbowma / cic-redex
  A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.
  ☆33Updated 7 years ago
• jozefg / undergraduate-thesis
  A discouraging story.
  ☆15Updated 6 years ago
• coq-community / atbr
  Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]
  ☆23Updated 4 months ago