TikhonJelvis / impLinks
Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.
☆15Updated 9 years ago
Alternatives and similar repositories for imp
Users that are interested in imp are comparing it to the libraries listed below
Sorting:
- "Toy" SMT Solver for Educational Purposes☆20Updated 12 years ago
- A general yet easy-to-use formalization of Big O, Big Theta, and more based on seminormed vector spaces.☆36Updated 8 years ago
- Semantics for Cryptol☆16Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Sturdy is a library for developing sound static analyses in Haskell.☆62Updated 2 years ago
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Updated 8 years ago
- Constructive Galois connections☆36Updated 7 years ago
- Implementation of Nuprl's type theory in Coq☆46Updated 11 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 4 months ago
- A language-generic implementation of equality saturation in Haskell☆21Updated 6 years ago
- ☆29Updated 10 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- The Prettiest Printer☆35Updated last year
- A general purpose programming language with linear types☆43Updated 8 years ago
- being some experiments, working towards some equipment I wish I had☆37Updated 9 years ago
- Link to preprints for POPL'18 and colocated events☆86Updated 7 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- ☆17Updated 8 years ago
- Coq & Haskell code for Calculating Correct Compilers II☆12Updated 3 years ago
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 3 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆31Updated last year
- Experiments in abstracting definitional interpreters☆16Updated 8 years ago
- Automatically exported from code.google.com/p/trellys☆47Updated 6 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- A classical propositional theorem prover in Haskell, using Wang's Algorithm.☆36Updated 6 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 8 years ago
- System F in coq.☆19Updated 10 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago