langston-barrett / souffle-lintLinks
A linter for Soufflé Datalog
☆16Updated last year
Alternatives and similar repositories for souffle-lint
Users that are interested in souffle-lint are comparing it to the libraries listed below
Sorting:
- Generate Soufflé Datalog types, relations, and facts that represent ASTs from a variety of programming languages.☆80Updated this week
- A toy symbolic execution engine, supporting the blog article ...☆18Updated 4 years ago
- Formalization of Typed Assembly Language (TAL) in Coq☆18Updated last year
- Genetic program repair using GHC☆33Updated last year
- Stratified synthesis for learning machine code instruction semantics☆40Updated 4 months ago
- LL(1) parser generator verified in Coq☆48Updated 6 years ago
- A tool for translating imperative programs to CSP.☆13Updated 8 years ago
- An automated theorem prover for intuitionistic propostional logic☆14Updated 5 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 3 years ago
- Interval datatype, interval arithmetic, and interval-based containers for Haskell☆22Updated this week
- A book about datalog☆12Updated 3 years ago
- Language-generic workbench for building static analysis☆46Updated 2 years ago
- Documented version of a simple type-theoretic language: Mini-TT☆18Updated 6 years ago
- Formalization of CBPV extended with effect and coeffect tracking☆14Updated last year
- A formally verified implementation of differential dynamic logic in Coq☆18Updated 3 years ago
- Haskell bindings for the Souffle datalog language☆104Updated last year
- Formalization of type theory☆22Updated 4 years ago
- ☆54Updated 3 months ago
- ☆16Updated 11 months ago
- A Lean 4 formalization of partial combinatory algebras.☆14Updated last year
- Benchmarking algebraic effect handler implementations☆27Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Graded Dependent Type systems☆25Updated 2 years ago
- The Steel separation logic library for F*☆36Updated 2 months ago
- A formally verified compiler for a simple language with numbers and sums☆27Updated 5 years ago
- Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.☆15Updated 9 years ago
- Constructive Galois connections☆36Updated 7 years ago
- Kleene algebra modulo theories☆27Updated 3 years ago
- CoFloCo is a static analysis tool written in prolog to infer automatically symbolic complexity bounds of imperative and recursive program…☆19Updated 4 years ago
- Pure haskell encoding of MLIR for printing, parsing, and mutating MLIR within haskell☆17Updated 5 years ago