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
- ☆29Updated 9 years ago
- ☆22Updated 8 years ago
- ☆18Updated 7 years ago
- "Toy" SMT Solver for Educational Purposes☆20Updated 11 years ago
- Link to preprints for POPL'18 and colocated events☆87Updated 6 years ago
- Semantics for Cryptol☆16Updated 6 years ago
- Generation of abstract binding trees☆27Updated 4 months ago
- Luck -- A Language for Property-Based Generators☆34Updated 7 years ago
- Bedrock Bit Vector Library☆27Updated 11 months ago
- ☆54Updated 2 months ago
- Formalising Type Theory in a modular way for translations between type theories☆90Updated 7 years ago
- A collection of small projects to illustrate how to write plugins for Coq☆21Updated 6 years ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 2 years ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- A formalization of properties of a simple imperative, memory-safe language.☆19Updated 3 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- This project contains various supporting libraries for lean to reason about protocols.☆42Updated 7 years ago
- being the programs and code for a paper about general recursion☆24Updated 10 years ago
- Experiments in abstracting definitional interpreters☆16Updated 7 years ago
- Supporting tool for Gradual Typing☆16Updated 4 years ago
- Foundational Verification of Hybrid Systems☆15Updated 7 years ago
- Distributed Separation Logic: a framework for compositional verification of distributed protocols and their implementations in Coq☆97Updated 6 months ago
- The Ynot Project source code.☆21Updated 10 years ago
- Implementation of Nuprl's type theory in Coq☆44Updated 2 months ago
- convert simple cryptol expressions into finite-state machines☆20Updated 7 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Updated 6 years ago
- Mirror of Conor McBride’s 2011 Agda course materials☆11Updated 6 years ago
- Model finder for higher-order logic☆41Updated last year
- List of ICFP'13 accepted papers, with links to preprint or additional information when available☆72Updated 8 years ago
- Compositional type checking for Haskell☆36Updated 13 years ago