vellvm / ctrees
An itree-like data-structure to additionally support internal non-determinism
☆15Updated last month
Alternatives and similar repositories for ctrees:
Users that are interested in ctrees are comparing it to the libraries listed below
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆35Updated last week
- Gallina to Bedrock2 compilation toolkit☆53Updated last week
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Updated 3 years ago
- ☆36Updated 5 months ago
- Coq library for serialization to S-expressions☆18Updated last year
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆31Updated 7 months ago
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆41Updated last month
- Implementation of Nuprl's type theory in Coq☆45Updated 3 months ago
- Partial Commutative Monoids☆28Updated 2 months ago
- Logical Relation for MLTT in Coq☆23Updated this week
- ☆29Updated last year
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆33Updated last month
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated 8 months ago
- Lenses in Coq☆17Updated 2 years ago
- Coq library for reasoning on randomized algorithms [maintainers=@anton-trunov,@volodeyka]☆25Updated 3 years ago
- ☆54Updated 3 weeks ago
- Deadlock freedom by type checking☆19Updated last year
- Finite sets and maps for Coq with extensional equality☆29Updated 3 months ago
- Relation algebra library for Coq☆48Updated 3 weeks ago
- A toy example of a verified compiler.☆28Updated 2 months ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 3 months ago
- Bedrock Bit Vector Library☆27Updated last year
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 6 months ago
- Probabilistic separation logics for verifying higher-order probabilistic programs.☆21Updated this week
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Coq Enhancement Proposals☆55Updated 2 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last week
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆50Updated 6 months ago
- A Seamless, Interactive Tactic Learner and Prover for Coq☆61Updated last month