Staged Abstract Interpreters
☆69Mar 13, 2023Updated 2 years ago
Alternatives and similar repositories for sai
Users that are interested in sai are comparing it to the libraries listed below
Sorting:
- ☆56Apr 25, 2025Updated 10 months ago
- A high-performance, parallel, compilation-based symbolic execution engine☆144Jan 26, 2026Updated last month
- Denotational semantics based on graph and filter models☆23Dec 16, 2024Updated last year
- ☆54Feb 20, 2026Updated last week
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆46Mar 9, 2025Updated 11 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- Tiny verified SAT-solver☆30Jan 7, 2022Updated 4 years ago
- Arete is an experimental programming language.☆12Oct 6, 2023Updated 2 years ago
- A cost-aware logical framework, embedded in Agda.☆77Feb 23, 2026Updated last week
- Fuzz testing for Dafny☆13Jul 7, 2022Updated 3 years ago
- ☆17Oct 31, 2025Updated 4 months ago
- Quasi-quoting library for agda☆18Nov 29, 2024Updated last year
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Sep 13, 2021Updated 4 years ago
- Graded Dependent Type systems☆25Jun 28, 2023Updated 2 years ago
- Best of POPL (BOP) Reading Group Memoirs☆67Jan 27, 2022Updated 4 years ago
- [research] A modular SMT solver in OCaml, based on mcSAT☆39Jan 1, 2024Updated 2 years ago
- Correctness of normalization-by-evaluation for STLC☆24Oct 1, 2019Updated 6 years ago
- Benchmark repository of polyglot effect handler examples☆34Aug 21, 2025Updated 6 months ago
- miniKanren with a first-order representation of the search space☆17Jul 23, 2024Updated last year
- Constructive Galois connections☆36Mar 26, 2018Updated 7 years ago
- A monadic library for symbolic evaluation☆73Jul 16, 2025Updated 7 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Aug 25, 2025Updated 6 months ago
- Experimenting on ornamentation in Agda via reflection.☆12Jul 1, 2023Updated 2 years ago
- A graduate seminar on SMT solving and solver-aided systems☆29Jul 17, 2022Updated 3 years ago
- Staged compilation with dependent types☆187Feb 1, 2026Updated last month
- Optimizing Abstract Abstract Machines☆31Apr 6, 2017Updated 8 years ago
- ☆34Updated this week
- Sturdy is a library for developing sound static analyses in Haskell.☆63Jun 23, 2023Updated 2 years ago
- Course on Metaprogramming☆75Feb 5, 2026Updated last month
- Materials for OPLSS 2021☆11Jun 1, 2021Updated 4 years ago
- ☆14Nov 23, 2016Updated 9 years ago
- Regular Invariant Generator and SMTLIB2 code transformer☆13Aug 8, 2022Updated 3 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Jun 3, 2017Updated 8 years ago
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆26Feb 8, 2026Updated 3 weeks ago
- a version of the 2048 game for Coq☆22Jan 30, 2026Updated last month
- Functional Pearl: Certified Binary Search in a Read-Only Array☆29May 26, 2021Updated 4 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆23Jan 28, 2026Updated last month
- An extension of the NbE algorithm to produce computational traces☆22May 5, 2022Updated 3 years ago
- prototyping logic programming in Scala☆42Mar 25, 2022Updated 3 years ago