Functions and proofs about game trees in Rocq, implemented as rose trees.
☆13Dec 2, 2025Updated 3 months ago
Alternatives and similar repositories for game-trees
Users that are interested in game-trees are comparing it to the libraries listed below
Sorting:
- Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.☆11Aug 28, 2024Updated last year
- Formalization of the Truly Stateless Concurrency Model Checker in Coq☆13Nov 16, 2021Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Tiny verified SAT-solver☆30Jan 7, 2022Updated 4 years ago
- A OCaml generator for well-typed terms (that use their arguments).☆11Feb 22, 2025Updated last year
- A programming language that deduces code from tests☆30Jan 8, 2018Updated 8 years ago
- Regular expression matching in Idris☆11Apr 27, 2016Updated 9 years ago
- Deciding Presburger arithmetic in agda☆33Mar 25, 2023Updated 2 years ago
- ☆12Jun 13, 2023Updated 2 years ago
- A compiler and bytecode interpreter for a subset of Python☆10Jan 23, 2021Updated 5 years ago
- ☆13Nov 23, 2019Updated 6 years ago
- Linearizability Hoare Logic☆17Feb 9, 2026Updated 3 weeks ago
- Coq formalization of algorithms due to Tarjan and Kosaraju for finding strongly connected graph components using Mathematical Components …☆18Oct 14, 2025Updated 4 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51May 5, 2022Updated 3 years ago
- an encoding of affine effect handlers using pthreads☆14Nov 15, 2022Updated 3 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- ☆16Feb 18, 2025Updated last year
- Verified Extraction from Rocq to OCaml/Malfunction☆14May 23, 2025Updated 9 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Jun 18, 2024Updated last year
- A library for non-deterministically parsing natural language expressions into a structured form.☆18Feb 3, 2023Updated 3 years ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Apr 3, 2023Updated 2 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12May 1, 2024Updated last year
- ☆13Jul 31, 2016Updated 9 years ago
- define ZF Set Theory in Agda and it's model on Ordinal and Ordinal Definable Set☆14Nov 14, 2025Updated 3 months ago
- A usable type system for call by push-value☆33Dec 16, 2019Updated 6 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- Dependently typed lambda calculus - A Simple Proof Assistant☆12Sep 3, 2020Updated 5 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Nov 19, 2017Updated 8 years ago
- Coq plugin for extracting Rust code☆18Dec 15, 2025Updated 2 months ago
- Provides a type-safe way of working with permutations in Idris☆37Oct 3, 2021Updated 4 years ago
- Tactic for polynomial manipulations☆13Jan 29, 2026Updated last month
- An experimental mutual induction tactic for Lean 4.☆23Jan 12, 2026Updated last month
- Implementation of the Delta Language☆13Mar 18, 2024Updated last year
- haha I'm graduating☆14Jul 22, 2021Updated 4 years ago
- Deferring the Details and Deriving Programs☆14Aug 18, 2019Updated 6 years ago
- Katamaran is a semi-automated separation logic verifier for the Sail specification language. It works on an embedded version of Sail call…☆19Updated this week
- A verified, modern, hardened memory allocator. [maintainer=@cmovcc]☆45Jan 24, 2026Updated last month
- Interpreter for λ̅μμ̃-calculus of Herbelin and Curien (for educational purposes).☆20Oct 8, 2020Updated 5 years ago
- ☆17Apr 4, 2024Updated last year