Alternatives and similar repositories for selective-theory-coq

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

• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆26Updated 5 years ago
• letouzey / coq-minicalc
  Toy demo of lexing/parsing in Coq
  ☆12Updated 6 years ago
• jonsterling / coq-domains
  ☆18Updated 3 years ago
• Ucombinator / parsing-with-zippers
  A clean implementation of Parsing with Zippers.
  ☆38Updated 7 years ago
• jdoughertyii / hott-species
  Combinatorial species in HoTT
  ☆12Updated 10 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 4 months ago
• ioanluca / real-world-idris
  Malfunction backend for Idris with a FFI to OCaml
  ☆28Updated 6 years ago
• jespercockx / reflection-tutorial
  ☆17Updated 7 years ago
• MatthewDaggitt / agda-routing
  An Agda library for reasoning about asynchronous iterative algorithms and network routing problems
  ☆28Updated last year
• llee454 / functional-algebra
  This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…
  ☆28Updated 6 years ago
• byorgey / enumeration
  Simple Haskell package for efficiently indexable finite and infinite enumerations.
  ☆12Updated 6 months ago
• metaocaml / metaocaml-bibliography
  MetaML and MetaOCaml bibliography
  ☆94Updated 10 months ago
• jonsterling / tt
  secret project
  ☆17Updated 7 years ago
• uwplse / CoqAST
  Fun plugin to play with the Gallina AST.
  ☆38Updated 6 years ago
• sweirich / corespec
  A Specification for Dependent Types in Haskell (Core)
  ☆64Updated 3 years ago
• L-TChen / FiniteSets
  Fintie Sets in Cubical Agda
  ☆12Updated 6 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• jonsterling / coq-guarded-computational-type-theory
  ☆21Updated 7 years ago
• dannywillems / RML
  ML modules and functors as first-class citizens by unifying ML modules and ML records with path dependent types and subtyping.
  ☆38Updated 3 years ago
• pigworker / potato
  being an experiment with potato power
  ☆23Updated 5 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆26Updated 10 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆21Updated 7 years ago
• JacquesCarette / finally-tagless
  Repo of the original work on finally tagless (and a lot of other metaocaml work besides)
  ☆43Updated 6 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• ichistmeinname / free-proving
  Resources for "One Monad to Prove Them All"
  ☆29Updated 6 years ago
• hablapps / LensAlgebra
  Towards Optic-Based Algebraic Theories: the Case of Lenses
  ☆17Updated 6 years ago
• gallais / pearl-binary-search
  Functional Pearl: Certified Binary Search in a Read-Only Array
  ☆29Updated 4 years ago
• yallop / staged-generic-programming
  Code for "Staged Generic Programming" (ICFP 2017)
  ☆27Updated 2 years ago