TikhonJelvis / imp
Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.
☆16Updated 9 years ago
Alternatives and similar repositories for imp:
Users that are interested in imp are comparing it to the libraries listed below
- "Toy" SMT Solver for Educational Purposes☆20Updated 11 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- ☆29Updated 9 years ago
- A general purpose programming language with linear types☆44Updated 8 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- Constructive Galois connections☆32Updated 6 years ago
- Compositional type checking for Haskell☆36Updated 13 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- being the beginnings of at least zero typecheckers☆33Updated 7 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- System F in coq.☆19Updated 10 years ago
- Use Conal Elliott's concat library to compile regular Haskell functions into Z3 equations☆38Updated 7 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 6 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated last year
- A copy of Daan Leijen's reference implementation of HMF (type inference)☆16Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- Deciding Presburger arithmetic in agda☆31Updated last year
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 3 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- being the programs and code for a paper about general recursion☆24Updated 10 years ago
- The Prettiest Printer☆35Updated last year
- Haskell implementation of P4F Control-Flow Analysis☆21Updated 2 years ago
- ET (IPL) language interpreters and literature☆26Updated 6 years ago
- wherein I implement several substructural logics in Agda☆24Updated 6 years ago
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆72Updated 5 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 3 months ago
- Fun plugin to play with the Gallina AST.☆38Updated 5 years ago