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
- ☆29Updated 9 years ago
- Compositional type checking for Haskell☆36Updated 13 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- The Prettiest Printer☆35Updated 9 months ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- System F in coq.☆19Updated 9 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated last year
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- A monadic approach to static analysis following the methodology of AAM☆19Updated 9 years ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated last month
- Constructive Galois connections☆32Updated 6 years ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 5 years ago
- A tool for translating imperative programs to CSP.☆10Updated 7 years ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆32Updated 7 years ago
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago
- ☆26Updated 7 years ago
- ☆18Updated 7 years ago
- being the beginnings of at least zero typecheckers☆31Updated 7 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 5 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Semantics for Cryptol☆16Updated 6 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- NbE course @ Chalmers☆28Updated last month