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:
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Formally verified Coq serialization library with support for extraction to OCaml☆24Updated 2 years ago
- Lenses in Coq☆17Updated 3 years ago
- ☆13Updated 5 years ago
- a version of the 2048 game for Coq☆22Updated 2 years ago
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆16Updated 2 years ago
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆13Updated 2 years ago
- Relation algebra library for Coq☆48Updated last month
- Implementation of Nuprl's type theory in Coq☆46Updated 10 months ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆32Updated 6 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆35Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- A style guide for Coq☆18Updated 3 years ago
- An enhanced unification algorithm for Coq☆58Updated 6 months ago
- Bedrock Bit Vector Library☆28Updated last month
- Tiny verified SAT-solver☆30Updated 3 years ago
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆25Updated last month
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- ☆18Updated 3 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 2 months ago
- Repo of the original work on finally tagless (and a lot of other metaocaml work besides)☆43Updated 6 years ago
- Finite sets and maps for Coq with extensional equality☆30Updated 4 months ago
- Formal Semantics for Why3☆19Updated last month
- Research material of Erik Palmgren (1963–2019)☆21Updated 6 months ago
- All the code I've ever written in Ltac2☆11Updated 4 years ago