A parser based on the ALL(*) algorithm, implemented and verified in Coq.
☆13Feb 14, 2023Updated 3 years ago
Alternatives and similar repositories for CoStar
Users that are interested in CoStar are comparing it to the libraries listed below
Sorting:
- Coq library for serialization to S-expressions☆20Jul 3, 2023Updated 2 years ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.☆21Mar 19, 2015Updated 10 years ago
- A simple λProlog interpreter☆20Nov 29, 2021Updated 4 years ago
- Reflective PHOAS rewriting/pattern-matching-compilation framework for simply-typed equalities and let-lifting☆26Feb 17, 2026Updated 2 weeks ago
- Formally verified Coq serialization library with support for extraction to OCaml☆24Oct 22, 2023Updated 2 years ago
- Foundational Verification of Hybrid Systems☆15Mar 23, 2017Updated 8 years ago
- Coq formalization of decision procedures for regular expression equivalence [maintainer=@anton-trunov]☆15Jul 22, 2024Updated last year
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆16Mar 13, 2023Updated 2 years ago
- A library for verifying graph-manipulating programs. Powered by Coq and VST. Compatible with CompCert.☆18Aug 21, 2025Updated 6 months ago
- Fully proved small C functions (examples for verification course).☆17Jun 26, 2017Updated 8 years ago
- Alternative implementation of the logical framework Dedukti in Rust☆23Apr 10, 2025Updated 10 months ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆35Jul 31, 2024Updated last year
- Coq plugin for monomorphization and C code generation☆40Jan 16, 2026Updated last month
- Official repository of the Autosubst 2 project.☆25May 8, 2023Updated 2 years ago
- Coq library on rewriting theory and termination☆37Jan 27, 2026Updated last month
- Template project for Coq plugins using the Dune build system, showcasing some advanced features [maintainer=@ejgallego]☆22Jul 13, 2023Updated 2 years ago
- αProlog☆18Jul 9, 2023Updated 2 years ago
- Specs and models for solving the DeadlockEmpire problems using TLA+ and TLC☆22Apr 11, 2019Updated 6 years ago
- Inefficient and syntactically unwieldy implementation of algebraic effects in Python using generators☆13Aug 31, 2020Updated 5 years ago
- Modular Finite Maps over Ordered Types in Coq [maintainers=@letouzey,@palmskog]☆11Jun 30, 2024Updated last year
- Schedule for ArtOfSAT☆10Oct 11, 2023Updated 2 years ago
- Universal instruction selection☆12Jun 8, 2018Updated 7 years ago
- The original parsing with derivatives haskell implementation☆12Aug 25, 2015Updated 10 years ago
- LL(1) parser generator verified in Coq☆48Jan 30, 2020Updated 6 years ago
- An implementation of "A Typed, Algebraic Approach to Parsing"☆11Mar 21, 2022Updated 3 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Jan 14, 2019Updated 7 years ago
- ☆13Nov 23, 2019Updated 6 years ago
- non-extensible/hardcoded pattern matching, core of MLStyle☆16Jun 10, 2021Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆32May 13, 2019Updated 6 years ago
- Coq library for working with de Bruijn indices [maintainer=@KevOrr]☆30Sep 15, 2021Updated 4 years ago
- Partial Commutative Monoids☆32Feb 18, 2026Updated last week
- Type qualifiers for C☆16Sep 21, 2011Updated 14 years ago
- Automated Reasoning for the Working Mathematician☆11Aug 30, 2019Updated 6 years ago
- Toy demo of lexing/parsing in Coq☆12Jul 3, 2019Updated 6 years ago
- Fault-tolerant distributed algorithms encoded in a formal language☆14Nov 30, 2020Updated 5 years ago
- the reflective tower Blond by Olivier Danvy & Karoline Malmkjær☆16May 21, 2025Updated 9 months ago
- An interval library for OCaml☆16Dec 9, 2022Updated 3 years ago
- Multinomials for the Mathematical Components library.☆16Updated this week
- TensorRight: Automated Verification of Tensor Graph Rewrites☆18Nov 9, 2025Updated 3 months ago