TikhonJelvis / imp
Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.
☆17Updated 8 years ago
Related projects ⓘ
Alternatives and complementary repositories for imp
- "Toy" SMT Solver for Educational Purposes☆20Updated 11 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- Compositional type checking for Haskell☆36Updated 13 years ago
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Updated 7 years ago
- A general purpose programming language with linear types☆44Updated 7 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆60Updated last year
- The Prettiest Printer☆35Updated 8 months ago
- being the beginnings of at least zero typecheckers☆31Updated 7 years ago
- A monadic approach to static analysis following the methodology of AAM☆19Updated 9 years ago
- System F in coq.☆19Updated 9 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 8 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- A tool for translating imperative programs to CSP.☆10Updated 7 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated 10 months ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 2 years ago
- Semantics for Cryptol☆16Updated 6 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- ☆29Updated 9 years ago
- Constructive Galois connections☆32Updated 6 years ago
- NbE course @ Chalmers☆28Updated last month
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 5 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated last year
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 4 years ago
- ☆23Updated 9 years ago
- ☆11Updated 7 years ago