dricketts / teaching-concurrency
Specifications and safety proofs in different tools of a simple concurrent algorithm
☆23Updated 4 years ago
Alternatives and similar repositories for teaching-concurrency:
Users that are interested in teaching-concurrency are comparing it to the libraries listed below
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Deadlock freedom by type checking☆19Updated last year
- Formalization of the Truly Stateless Concurrency Model Checker in Coq☆13Updated 3 years ago
- Type-driven, component based synthesis, showcasing TYpe Guided Abstract Refinement (TYGAR)☆60Updated 2 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last week
- Constructive Galois connections☆32Updated 7 years ago
- Notes and handouts from OPLSS 2018☆54Updated 6 years ago
- Gallina to Bedrock2 compilation toolkit☆53Updated last week
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆47Updated 5 months ago
- EGraphs in OCaml☆65Updated last year
- Writeup that goes along with this:☆40Updated 7 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- Coq utility and tactic library.☆21Updated last year
- An enhanced unification algorithm for Coq☆54Updated last month
- Advanced Topics in Programming Languages, Penn CIS 670, Fall 2016☆42Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- Finite sets and maps for Coq with extensional equality☆29Updated 3 months ago
- handouts and notes from the 2017 edition of the summer school☆39Updated 7 years ago
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆31Updated 7 months ago
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆12Updated 2 years ago
- Convert Haskell source code to Coq source code.☆83Updated 7 months ago
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated 8 months ago
- NbE course @ Chalmers☆28Updated 6 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- Topics in Programming Languages: Denotational Semantics, Spring 2018 Course at Indiana University☆72Updated 6 years ago
- A monadic library for symbolic evaluation☆59Updated last month
- A cost-aware logical framework, embedded in Agda.☆61Updated 7 months ago
- Coq formalizations and proofs of (data) structures and algorithms.☆46Updated 6 years ago
- Best of POPL (BOP) Reading Group Memoirs☆67Updated 3 years ago