acorrenson / minilog
A verified Implementation of a mini prolog
☆13Updated last year
Related projects ⓘ
Alternatives and complementary repositories for minilog
- A simple λProlog interpreter☆20Updated 2 years ago
- A reflection-based proof tactic for lattices in Coq☆20Updated last year
- Tactic for polynomial manipulations☆10Updated 9 months ago
- a version of the 2048 game for Coq☆22Updated last year
- Formal Semantics for Why3☆14Updated this week
- ☆13Updated 4 years ago
- Implementation of sprintf for Coq☆18Updated 4 years ago
- A LaTeX package to make theorem names link to coqdoc webpages. Works with ntheorem, amsthm and the LLNCS and LIPIcs classes.☆15Updated 5 years ago
- Formalisation of a capability machine and principles for reasoning about security properties☆17Updated last week
- A generic goal preprocessing tool for proof automation tactics in Coq☆14Updated 3 weeks ago
- A Coq plugin that implements exceptions in Coq☆13Updated 3 years ago
- ☆11Updated last year
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆12Updated last year
- Tiny verified SAT-solver☆28Updated 2 years ago
- Formalising session types in Coq☆17Updated 5 years ago
- Some programs from Rustan Leino's "Program Proofs", in Why3.☆14Updated last year
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆14Updated 8 months ago
- Automatically generates Coq FFI bindings to OCaml libraries [maintainer=@lthms]☆34Updated last year
- IO for Gallina☆31Updated 2 months ago
- MIRROR of https://codeberg.org/catseye/Philomath : An LCF-style theorem prover written in C89 (a.k.a ANSI C)☆14Updated 11 months ago
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Updated 6 years ago
- A simple supercompiler formally verified in Agda☆29Updated 7 years ago
- An abstract-interpretation-based static analysis for inferring refinement types☆16Updated last week
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- A small Coq library for collecting side conditions and deferring their proof☆24Updated 5 years ago
- Coq development accompanying the paper "Efficient Extensional Binary Tries"☆19Updated 7 months ago
- Toy demo of lexing/parsing in Coq☆12Updated 5 years ago
- Yet Another deep embedding of Linear Logic in Coq☆14Updated 2 months ago
- A simple BDD library for OCaml☆13Updated 2 years ago