nyu-acsys / driftLinks
An abstract-interpretation-based static analysis for inferring refinement types
☆16Updated 4 months ago
Alternatives and similar repositories for drift
Users that are interested in drift are comparing it to the libraries listed below
Sorting:
- 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
- Tiny verified SAT-solver☆30Updated 3 years ago
- ☆13Updated 6 years ago
- A verified Implementation of a mini prolog☆17Updated 3 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- 👹 A library for hierarchical names and lexical scoping☆26Updated 2 weeks ago
- a version of the 2048 game for Coq☆22Updated 2 years ago
- ☆15Updated 4 months ago
- Verified Extraction from Rocq to OCaml/Malfunction☆13Updated 6 months ago
- Library for Classical Coq☆39Updated 6 months ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆35Updated last year
- Fun plugin to play with the Gallina AST.☆38Updated 6 years ago
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- Tactic for polynomial manipulations☆12Updated 6 months ago
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆25Updated 10 months ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]☆24Updated last year
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- Code for "Staged Generic Programming" (ICFP 2017)☆28Updated 2 years ago
- A constraint solver built from scratch in OCaml☆12Updated 4 years ago
- A Coq plugin that implements exceptions in Coq☆13Updated 4 years ago
- Formalising session types in Coq☆17Updated 6 years ago
- flexible 'let rec' generation for MetaOCaml☆27Updated 3 months ago
- Finite sets and maps for Coq with extensional equality☆30Updated 3 weeks ago
- A proof of Abel-Ruffini theorem.☆30Updated last month
- Coq library on rewriting theory and termination☆37Updated last week
- A simple λProlog interpreter☆20Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- A fornalisation of Grobner basis in ssreflect☆12Updated 3 weeks ago