acorrenson / minilogLinks
A verified Implementation of a mini prolog
☆17Updated 3 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
- An abstract-interpretation-based static analysis for inferring refinement types☆16Updated 4 months ago
- Formal Semantics for Why3☆19Updated 2 months ago
- 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 6 months ago
- Library for Classical Coq☆39Updated 6 months ago
- Katamaran is a semi-automated separation logic verifier for the Sail specification language. It works on an embedded version of Sail call…☆18Updated this week
- MIRROR of https://codeberg.org/catseye/Philomath : An LCF-style theorem prover written in C89 (a.k.a ANSI C)☆16Updated last year
- A library for verifying graph-manipulating programs. Powered by Coq and VST. Compatible with CompCert.☆18Updated 3 months ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- A simple λProlog interpreter☆20Updated 4 years ago
- ☆13Updated 6 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Verified Extraction from Rocq to OCaml/Malfunction☆13Updated 6 months ago
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆25Updated 10 months ago
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆16Updated 2 years ago
- Formalisation of a capability machine and principles for reasoning about security properties☆22Updated 5 months ago
- Experiments with Realizability in Univalent Type Theory☆19Updated last year
- 👹 A library for hierarchical names and lexical scoping☆26Updated 2 weeks ago
- A Coq tactic for proving multivariate inequalities using SDP solvers☆11Updated last week
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- Finite sets and maps for Coq with extensional equality☆30Updated 3 weeks ago
- Companion Coq development for Xavier Leroy's 2021 lectures on program logics☆40Updated 4 years ago
- Yet Another deep embedding of Linear Logic in Coq☆16Updated 3 months ago
- Coq development accompanying the paper "Efficient Extensional Binary Tries"☆21Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- A LaTeX package to make theorem names link to coqdoc webpages. Works with ntheorem, amsthm and the LLNCS and LIPIcs classes.☆21Updated 6 years ago