coq-community / regexp-Brzozowski
Coq formalization of decision procedures for regular expression equivalence [maintainer=@anton-trunov]
☆13Updated 4 months ago
Related projects ⓘ
Alternatives and complementary repositories for regexp-Brzozowski
- a version of the 2048 game for Coq☆22Updated last year
- Lenses in Coq☆16Updated 2 years ago
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆14Updated last year
- A reflection-based proof tactic for lattices in Coq☆20Updated last year
- A fornalisation of Grobner basis in ssreflect☆12Updated last year
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆12Updated last year
- ☆13Updated 4 years ago
- ☆18Updated 2 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆29Updated 3 months ago
- Research material of Erik Palmgren (1963–2019)☆20Updated last year
- Partial Commutative Monoids☆26Updated 2 weeks ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆23Updated last month
- ☆17Updated 2 years ago
- Formally verified Coq serialization library with support for extraction to OCaml☆23Updated last year
- Code for "Staged Generic Programming" (ICFP 2017)☆26Updated last year
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Kleene algebra modulo theories☆27Updated 2 years ago
- Formalising session types in Coq☆17Updated 5 years ago
- Bedrock Bit Vector Library☆27Updated 8 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Finite sets and maps for Coq with extensional equality☆29Updated last year
- Implementation of Nuprl's type theory in Coq☆44Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- Relation algebra library for Coq☆48Updated last week
- A library for Gradual Certified Programming in Coq☆9Updated 9 years ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago