wangpengmit / 6887psets
Problem Sets for MIT 6.887 Formal Reasoning About Programs
☆8Updated 8 years ago
Related projects ⓘ
Alternatives and complementary repositories for 6887psets
- The Ynot Project source code.☆21Updated 10 years ago
- A library for effects in Coq.☆64Updated 2 years ago
- Automatically exported from code.google.com/p/trellys☆46Updated 5 years ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆52Updated last month
- Model finder for higher-order logic☆41Updated 11 months ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Library of Unix effects for Coq.☆23Updated 5 years ago
- Formalising Type Theory in a modular way for translations between type theories☆90Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆32Updated 7 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆41Updated 2 years ago
- Notes and handouts from OPLSS 2018☆53Updated 6 years ago
- Tool for generating Locally Nameless definitions and proofs in Coq, working together with Ott☆30Updated 2 weeks ago
- Link to preprints for POPL'18 and colocated events☆87Updated 6 years ago
- ☆51Updated 3 weeks ago
- ☆80Updated 6 months ago
- ☆59Updated 5 years ago
- ☆82Updated 7 years ago
- A framework for extensible, reflective decision procedures.☆19Updated 4 years ago
- Coq proofs for the paper "Calculating Correct Compilers"☆30Updated 10 months ago
- Implementation of Nuprl's type theory in Coq☆44Updated 3 years ago
- Coq with native compilation, as well as machine integers and arrays !☆62Updated 6 years ago
- Work in progress☆34Updated 3 months ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆42Updated 10 months ago
- The Penn Locally Nameless Metatheory Library☆71Updated 4 months ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- ☆29Updated 9 years ago
- A Racket library for interacting with Idris over the IDE protocol☆30Updated 6 years ago
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆110Updated 5 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated last year