vellvm / ctrees
An itree-like data-structure to additionally support internal non-determinism
☆15Updated 2 months ago
Alternatives and similar repositories for ctrees:
Users that are interested in ctrees are comparing it to the libraries listed below
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated 4 months ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆30Updated 5 months ago
- LeanSSR: an SSReflect-Like Tactic Language for Lean☆32Updated 4 months ago
- Coq Enhancement Proposals☆52Updated this week
- Regular Language Representations in Coq [maintainers=@chdoc,@palmskog]☆41Updated 5 months ago
- Stable sort algorithms and their stability proofs in Coq☆22Updated 4 months ago
- Implementation of Nuprl's type theory in Coq☆45Updated last month
- Relation algebra library for Coq☆48Updated 2 months ago
- Coq library for reasoning on randomized algorithms [maintainers=@anton-trunov,@volodeyka]☆25Updated 3 years ago
- Partial Commutative Monoids☆28Updated this week
- Coq library for serialization to S-expressions☆18Updated last year
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated 11 months ago
- ☆35Updated 2 months ago
- Algebraic proof discovery in Agda☆32Updated 3 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 5 years ago
- Coq plugin providing tactics for rewriting universally quantified equations, modulo associative (and possibly commutative) operators [mai…☆30Updated 2 months ago
- Observational Type Theory as an Agda library☆52Updated 7 years ago
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated 6 months ago
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆33Updated this week
- Lenses in Coq☆16Updated 2 years ago
- Linear Temporal Logic☆19Updated last year
- Datatypes as quotients of polynomial functors☆35Updated 4 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- A bottom-up approach to a verified implementation of MLTT☆17Updated this week
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 4 months ago
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆22Updated this week
- Lifting Reduction Semantics through Syntactic Sugar☆13Updated 6 years ago
- Deadlock freedom by type checking☆19Updated last year
- A Cheat Sheet for Coq Developers who want to try LeanProver☆15Updated last year
- A Tutorial on Reflecting in Coq the generation of Hoare proof obligations [maintainer=@k4rtik]☆19Updated 3 years ago