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
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆24Updated 4 years ago
- Finite sets and maps for Coq with extensional equality☆30Updated 4 months ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆47Updated 6 months ago
- A cost-aware logical framework, embedded in Agda.☆61Updated 8 months ago
- A verified compiler for a lazy functional language☆35Updated this week
- LL(1) parser generator verified in Coq☆46Updated 5 years ago
- Gallina to Bedrock2 compilation toolkit☆53Updated last week
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated 9 months ago
- Program verification with F* course materials☆12Updated 5 years ago
- Unassorted scribbles on formal methods, type theory, category theory, and so on, and so on☆21Updated last year
- Two-Level Type Theory☆28Updated 5 years ago
- Deadlock freedom by type checking☆20Updated last year
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 7 months ago
- Companion Coq development for Xavier Leroy's 2021 lectures on program logics☆40Updated 4 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 4 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- This is a Coq formalization of Damas-Milner type system and its algorithm W.☆29Updated 4 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- A monadic library for symbolic evaluation☆60Updated last week
- Formalization of the Truly Stateless Concurrency Model Checker in Coq☆13Updated 3 years ago
- Canonical is a performant sound and complete type inhabitation solver for dependent type theory.☆20Updated last week
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆31Updated 8 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated last month
- Coq formalizations and proofs of (data) structures and algorithms.☆46Updated 6 years ago
- Writeup that goes along with this:☆40Updated 7 years ago
- A modular library for CDCL(T) SMT solvers, with [wip] proof generation.☆24Updated 2 months ago
- Dafny for Metatheory of Programming Languages☆25Updated 3 months ago
- Dependently typed lambda calculus - A Simple Proof Assistant☆12Updated 4 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago