An abstract-interpretation-based static analysis for inferring refinement types
☆16Aug 11, 2025Updated 6 months ago
Alternatives and similar repositories for drift
Users that are interested in drift are comparing it to the libraries listed below
Sorting:
- Hoare Type Theory☆84Jun 12, 2025Updated 8 months ago
- Formalisation of a capability machine and principles for reasoning about security properties☆26Jul 4, 2025Updated 8 months ago
- Tiny verified SAT-solver☆30Jan 7, 2022Updated 4 years ago
- A certified semantics for relational programming workout.☆26Oct 15, 2020Updated 5 years ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆24Oct 21, 2024Updated last year
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19May 27, 2024Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Scala Step-by-Step: Soundness for DOT with Step-Indexed Logical Relations in Iris — Coq Formalization☆37Feb 20, 2026Updated 2 weeks ago
- Experimental model finder/SMT solver for functional programming.☆23Jun 23, 2022Updated 3 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆22Nov 20, 2025Updated 3 months ago
- Companion Coq development for Xavier Leroy's 2021 lectures on program logics☆42Apr 14, 2021Updated 4 years ago
- A clean implementation of Parsing with Zippers.☆38Sep 22, 2018Updated 7 years ago
- Library for Classical Coq☆41Jan 20, 2026Updated last month
- A mini language for logic programming☆23Jun 5, 2020Updated 5 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22May 20, 2021Updated 4 years ago
- A web interactive tool for building proofs in the sequent calculus of Linear Logic, with its backend written in OCaml☆24Apr 7, 2025Updated 11 months ago
- Ocaml code from Writing an Interpreter in Go☆11Aug 16, 2019Updated 6 years ago
- An open format definition for static analysis tools☆11Jan 20, 2023Updated 3 years ago
- Scheme libraries written or packaged for R7RS implementations☆13Apr 7, 2018Updated 7 years ago
- formally and easily, describe the semantics.☆13Aug 17, 2020Updated 5 years ago
- A revival of the TREE-META compiler-compiler.☆15May 15, 2018Updated 7 years ago
- Experimental normalisation via scheme☆12Jul 25, 2021Updated 4 years ago
- SVM Abstrac Verifier tool☆12Oct 13, 2022Updated 3 years ago
- Arete is an experimental programming language.☆12Oct 6, 2023Updated 2 years ago
- A constraint solver built from scratch in OCaml☆12Dec 10, 2021Updated 4 years ago
- Collection of generative art made by me.☆10Jul 8, 2018Updated 7 years ago
- Survey on materials that touch on the history of Lambda Calculus☆12Sep 13, 2020Updated 5 years ago
- Libraries demonstrating design patterns for programming and proving with canonical structures in Coq [maintainer=@anton-trunov]☆27Updated this week
- A proof of Abel-Ruffini theorem.☆30Oct 17, 2025Updated 4 months ago
- 👹 A library for hierarchical names and lexical scoping☆26Nov 21, 2025Updated 3 months ago
- Formalization of C++ for verification purposes.☆90Feb 23, 2026Updated last week
- Fintie Sets in Cubical Agda☆12Aug 30, 2019Updated 6 years ago
- Effectful Streaming for Idris☆15Dec 13, 2020Updated 5 years ago
- An infinity-categorical coherence typechecker☆18Nov 4, 2024Updated last year
- ☆13Jul 24, 2021Updated 4 years ago
- ☆16Feb 18, 2025Updated last year
- Relational algebra implementation in Agda with simple bindings to SQLITE☆13Oct 9, 2023Updated 2 years ago
- Formalising Turing Machines In Coq (bachelor's thesis)☆12Jul 5, 2023Updated 2 years ago