dricketts / teaching-concurrencyLinks
Specifications and safety proofs in different tools of a simple concurrent algorithm
☆23Updated 5 years ago
Alternatives and similar repositories for teaching-concurrency
Users that are interested in teaching-concurrency are comparing it to the libraries listed below
Sorting:
- Deadlock freedom by type checking☆20Updated 2 years ago
- A monadic library for symbolic evaluation☆68Updated last month
- Template project for program verification in Coq, showcasing reasoning on CompCert's Clight language using the Verified Software Toolchai…☆32Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Updated 4 years ago
- A style guide for Coq☆18Updated 3 years ago
- Finite sets and maps for Coq with extensional equality☆30Updated 2 months ago
- A cost-aware logical framework, embedded in Agda.☆64Updated 2 weeks ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Relation algebra library for Coq☆49Updated 4 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 5 months ago
- Typing the linear pi calculus in Agda☆29Updated 3 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆20Updated 3 months 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
- BibTeX bibliographies for proof engineering-related papers☆30Updated 6 years ago
- Gallina to Bedrock2 compilation toolkit☆59Updated last week
- Notes and handouts from OPLSS 2019☆34Updated 6 years ago
- Formalization of CBPV extended with effect and coeffect tracking☆13Updated 11 months ago
- Unassorted scribbles on formal methods, type theory, category theory, and so on, and so on☆23Updated last year
- An extension to PUMPKIN PATCH with support for proof repair across type equivalences.☆49Updated last month
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆51Updated last year
- A deterministic parser with fused lexing☆74Updated 2 years ago
- Coq utility and tactic library.☆24Updated last year
- ☆55Updated 4 months ago
- Graded Dependent Type systems☆25Updated 2 years ago
- A reflection-based proof tactic for lattices in Coq☆22Updated last year
- haha I'm graduating☆14Updated 4 years ago
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆13Updated 2 years ago
- A tutorial on how Agda infers things☆60Updated last month
- Logical relation for predicative CC omega with booleans and an intensional identity type☆13Updated 3 months ago