mit-frap / spring17
Problem Sets for MIT 6.887 Formal Reasoning About Programs, Spring 2017
☆20Updated 7 years ago
Alternatives and similar repositories for spring17:
Users that are interested in spring17 are comparing it to the libraries listed below
- ☆22Updated 9 years ago
- ☆29Updated 9 years ago
- Bedrock Bit Vector Library☆27Updated last year
- ☆18Updated 7 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 11 years ago
- Semantics for Cryptol☆16Updated 6 years ago
- A collection of small projects to illustrate how to write plugins for Coq☆21Updated 6 years ago
- ☆54Updated 3 weeks ago
- gallina frontend for CompCert☆17Updated 5 years ago
- Constructive Galois connections☆32Updated 6 years ago
- Luck -- A Language for Property-Based Generators☆34Updated 3 weeks ago
- Foundational Verification of Hybrid Systems☆15Updated 8 years ago
- Generation of abstract binding trees☆27Updated 5 months ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- Link to preprints for POPL'18 and colocated events☆87Updated 6 years ago
- Implementation of Nuprl's type theory in Coq☆45Updated 3 months ago
- A discouraging story.☆15Updated 6 years ago
- Formalising Type Theory in a modular way for translations between type theories☆91Updated 7 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- A standalone implementation of Ltac2 as a Coq plugin. Now part of the main Coq repository.☆31Updated 5 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 2 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated 9 months ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 3 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Updated 7 years ago
- A Haskell parser for JVM bytecode files☆38Updated last year
- A formalization of properties of a simple imperative, memory-safe language.☆19Updated 3 years ago
- Some scripts for analyzing IMP programs with the Z3 automatic theorem prover, originally written for my Compose 2016 talk.☆16Updated 9 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago