rocq-community / regexp-BrzozowskiLinks
Coq formalization of decision procedures for regular expression equivalence [maintainer=@anton-trunov]
☆13Updated 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:
- ☆13Updated 5 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 8 months ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆32Updated last year
- a version of the 2048 game for Coq☆22Updated last year
- Finite sets and maps for Coq with extensional equality☆30Updated 2 months ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆24Updated 10 months ago
- Relation algebra library for Coq☆49Updated 5 months ago
- Algebraic Combinatorics in Coq☆38Updated 7 months ago
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆25Updated 7 months ago
- Formally verified Coq serialization library with support for extraction to OCaml☆24Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- Examples from our paper "Capturing the Future by Replaying the Past"☆23Updated 11 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Coq library on rewriting theory and termination☆36Updated 2 weeks ago
- Constructive Galois connections☆35Updated 7 years ago
- Bedrock Bit Vector Library☆28Updated 2 months ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆31Updated 6 years ago
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆13Updated 2 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- ☆18Updated 3 years ago
- An enhanced unification algorithm for Coq☆56Updated 4 months ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 6 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆61Updated 11 months ago
- Congruence Closure Procedure in Cubical Agda☆17Updated 5 years ago
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- Research material of Erik Palmgren (1963–2019)☆21Updated 4 months ago
- MPRI-2.4 Dependently-typed Functional Programming☆32Updated 4 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago