rocq-community / regexp-BrzozowskiLinks
Coq formalization of decision procedures for regular expression equivalence [maintainer=@anton-trunov]
☆14Updated last year
Alternatives and similar repositories for regexp-Brzozowski
Users that are interested in regexp-Brzozowski are comparing it to the libraries listed below
Sorting:
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- a version of the 2048 game for Coq☆22Updated 2 years ago
- ☆13Updated 6 years ago
- Relation algebra library for Coq☆48Updated 2 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆32Updated 6 years ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆24Updated last year
- Implementation of Nuprl's type theory in Coq☆46Updated 11 months ago
- Lenses in Coq☆17Updated 3 years ago
- Coq library on rewriting theory and termination☆37Updated last week
- Formally verified Coq serialization library with support for extraction to OCaml☆24Updated 2 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆25Updated last month
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Finite sets and maps for Coq with extensional equality☆30Updated last week
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆35Updated last year
- Tiny verified SAT-solver☆30Updated 3 years ago
- Library for Classical Coq☆39Updated 6 months ago
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆16Updated 2 years ago
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆25Updated 9 months ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆13Updated 2 years ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Implementation of sprintf for Coq☆18Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆37Updated 2 months ago
- An enhanced unification algorithm for Coq☆58Updated 7 months ago