acorrenson / SATurne
Tiny verified SAT-solver
☆28Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for SATurne
- a version of the 2048 game for Coq☆22Updated last year
- Ring, field, lra, nra, and psatz tactics for Mathematical Components☆33Updated 2 months ago
- Formal Semantics for Why3☆14Updated this week
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated 9 months ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Mechanizations of Type Theories☆27Updated this week
- Kleene algebra modulo theories☆27Updated 2 years ago
- Deadlock freedom by type checking☆19Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 5 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆29Updated 3 months ago
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- Automatically generates Coq FFI bindings to OCaml libraries [maintainer=@lthms]☆34Updated last year
- Dependently typed lambda calculus - A Simple Proof Assistant☆11Updated 4 years ago
- Experiments with higher-order abstract syntax in Agda☆19Updated 2 years ago
- ModTT in Agda☆11Updated 3 years ago
- A reflection-based proof tactic for lattices in Coq☆20Updated last year
- A cost-aware logical framework, embedded in Agda.☆56Updated 3 months ago
- Finite sets and maps for Coq with extensional equality☆29Updated last year
- A verified, modern, hardened memory allocator.☆14Updated last month
- IO for Gallina☆31Updated 2 months ago
- Companion Coq development for Xavier Leroy's 2021 lectures on program logics☆40Updated 3 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆18Updated 5 months ago
- Logical Relation for MLTT in Coq☆19Updated this week
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆19Updated 2 years ago
- AACMM's generic-syntax, but with QTT-style annotations☆20Updated 7 months ago
- Quasi-quoting library for agda☆17Updated 4 years ago
- being an implementation of the calculus of constructions☆15Updated last year
- ☆27Updated last year