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
  ☆35Updated 4 years ago
• L-TChen / FiniteSets
  Fintie Sets in Cubical Agda
  ☆12Updated 5 years ago
• jonsterling / coq-domains
  ☆18Updated 3 years ago
• metaocaml / metaocaml-opam
  A repository of MetaOCaml packages
  ☆12Updated last month
• jespercockx / reflection-tutorial
  ☆17Updated 6 years ago
• pigworker / Totality
  being the programs and code for a paper about general recursion
  ☆25Updated 10 years ago
• 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
• dboulytchev / miniKanren-coq
  A certified semantics for relational programming workout.
  ☆26Updated 4 years ago
• benjaminselfridge / logix
  Logic Explorer - customizable proof construction tool for sequent calculi
  ☆20Updated 3 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated last week
• mietek / agda-intro
  Mirror of Conor McBride’s 2011 Agda course materials
  ☆12Updated 6 years ago
• pigworker / ProgrammerCommaCon
  being a collection of Agda-facilitated ramblings
  ☆33Updated 5 years ago
• yallop / staged-generic-programming
  Code for "Staged Generic Programming" (ICFP 2017)
  ☆26Updated last year
• RyanGlScott / eliminators
  Dependently typed elimination functions using singletons
  ☆28Updated 5 months ago
• byorgey / enumeration
  Simple Haskell package for efficiently indexable finite and infinite enumerations.
  ☆12Updated 2 months ago
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆19Updated 6 years ago
• letouzey / coq-minicalc
  Toy demo of lexing/parsing in Coq
  ☆12Updated 5 years ago
• bobatkey / modulog
  A Datalog implementation with an OCaml inspired module system
  ☆44Updated 6 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 4 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆28Updated 6 months ago
• jespercockx / popl19-tutorial
  Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais
  ☆26Updated 6 years ago
• alhassy / multistage-programming-taha
  A Haskell implementation of the code within Walid Taha's ``A Gentle Introduction to Multi-stage Programming''
  ☆10Updated 6 years ago
• HuwCampbell / idris-lens
  van Laarhoven lenses for Idris
  ☆20Updated 7 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• dalaing / type-systems
  ☆23Updated 7 years ago
• gallais / pearl-binary-search
  Functional Pearl: Certified Binary Search in a Read-Only Array
  ☆29Updated 4 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• jdoughertyii / hott-species
  Combinatorial species in HoTT
  ☆12Updated 10 years ago
• ayberkt / simplc
  A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.
  ☆16Updated 5 years ago
• gdijkstra / hs-to-gallina
  Experimentation project
  ☆16Updated 11 years ago