acorrenson / minilogLinks
A verified Implementation of a mini prolog
☆17Updated 2 years ago
Alternatives and similar repositories for minilog
Users that are interested in minilog are comparing it to the libraries listed below
Sorting:
- Tiny verified SAT-solver☆30Updated 3 years ago
- Formal Semantics for Why3☆19Updated last month
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆13Updated 2 years ago
- a version of the 2048 game for Coq☆22Updated 2 years ago
- Tactic for polynomial manipulations☆12Updated 5 months ago
- A simple λProlog interpreter☆20Updated 3 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆25Updated 9 months ago
- An abstract-interpretation-based static analysis for inferring refinement types☆16Updated 2 months ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- Library for Classical Coq☆39Updated 5 months ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- IO for Gallina☆32Updated 4 months ago
- A bare-bones LCF-style proof assistant☆24Updated 6 years ago
- ☆13Updated 5 years ago
- Verified Extraction from Rocq to OCaml/Malfunction☆13Updated 5 months ago
- MIRROR of https://codeberg.org/catseye/Philomath : An LCF-style theorem prover written in C89 (a.k.a ANSI C)☆16Updated last year
- Katamaran is a semi-automated separation logic verifier for the Sail specification language. It works on an embedded version of Sail call…☆18Updated last week
- Companion Coq development for Xavier Leroy's 2021 lectures on program logics☆40Updated 4 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆16Updated 2 years ago
- A formatter/linter for Coq source☆14Updated 3 years ago
- flexible 'let rec' generation for MetaOCaml☆26Updated 2 months ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- A library for verifying graph-manipulating programs. Powered by Coq and VST. Compatible with CompCert.☆18Updated 2 months ago
- A Coq tactic for proving multivariate inequalities using SDP solvers☆11Updated last month
- Algebraic proof discovery in Agda☆35Updated 3 years ago
- Interactive Theorem Proving for students☆20Updated 2 years ago
- A LaTeX package to make theorem names link to coqdoc webpages. Works with ntheorem, amsthm and the LLNCS and LIPIcs classes.☆20Updated 6 years ago
- Coq library for serialization to S-expressions☆19Updated 2 years ago