Alternatives and similar repositories for regex-deriv-coq

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

• svenkeidel / sturdy
  Sturdy is a library for developing sound static analyses in Haskell.
  ☆61Updated 2 years ago
• pi8027 / lambda-calculus
  A Formalization of Typed and Untyped λ-Calculi in Coq and Agda2
  ☆83Updated 5 years ago
• pi8027 / stablesort
  Stable sort algorithms and their stability proofs in Rocq
  ☆24Updated last week
• Tritlo / PropR
  Genetic program repair using GHC
  ☆30Updated last year
• anuyts / agda-sessions
  Learn the Agda basics in three 2-hour sessions.
  ☆59Updated last year
• conal / paper-2021-language-derivatives
  Paper and talk
  ☆54Updated 2 years ago
• Lysxia / system-F
  Formalization of the polymorphic lambda calculus and its parametricity theorem
  ☆35Updated 4 months ago
• IagoAbal / haskell-z3
  Haskell bindings to Microsoft's Z3 API (unofficial).
  ☆59Updated last year
• FreeProving / free-compiler
  A Haskell to Coq compiler that represents effectful programs with the free monad
  ☆45Updated 3 years ago
• vrahli / NuprlInCoq
  Implementation of Nuprl's type theory in Coq
  ☆45Updated 7 months ago
• TyGuS / hoogle_plus
  Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)
  ☆60Updated this week
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆55Updated 2 years ago
• frex-project / idris-frex
  ☆48Updated last month
• adamgundry / type-inference
  Unification and type inference algorithms
  ☆125Updated 10 years ago
• pedagand / typechecker-evolution
  The Evolution of a Typechecker
  ☆54Updated 6 years ago
• stoeffel / haskell-simple-dsl-examples
  Simple examples on how to implement a DSL in Haskell.
  ☆19Updated 5 years ago
• ayberkt / formal-topology-in-UF
  Formal Topology in Univalent Foundations (WIP).
  ☆36Updated 2 years ago
• metaborg / linear.agda
  A library and case-study for linear, intrinsically-typed interpreters in Agda
  ☆35Updated 5 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 4 years ago
• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆81Updated 3 years ago
• dlicata335 / hott-agda
  ☆84Updated 7 years ago
• plum-umd / cgc
  Constructive Galois connections
  ☆32Updated 7 years ago
• uwplse / pumpkin-pi
  An extension to PUMPKIN PATCH with support for proof repair across type equivalences.
  ☆49Updated 3 weeks ago
• rocq-community / coqeal
  The Coq Effective Algebra Library [maintainers=@CohenCyril,@proux01]
  ☆71Updated 3 weeks ago
• rocq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆59Updated 10 months ago
• lthms / FreeSpec
  A framework for implementing and certifying impure computations in Coq
  ☆52Updated last year
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆56Updated 3 months ago
• sstucki / system-f-agda
  A formalization of the polymorphic lambda calculus extended with iso-recursive types
  ☆71Updated 6 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
• csabahruska / p4f-control-flow-analysis
  Haskell implementation of P4F Control-Flow Analysis
  ☆21Updated 3 years ago