TiarkRompf / reachabilityLinks
☆53Updated last month
Alternatives and similar repositories for reachability
Users that are interested in reachability are comparing it to the libraries listed below
Sorting:
- A prototype programming language with polymorphic reachability types that track freshness, sharing and separation.☆44Updated 9 months ago
- A deterministic parser with fused lexing☆74Updated 2 years ago
- ☆41Updated 3 months ago
- Best of POPL (BOP) Reading Group Memoirs☆67Updated 3 years ago
- PL conference deadline countdowns☆63Updated this week
- A monadic library for symbolic evaluation☆73Updated 4 months ago
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆56Updated 5 months ago
- A mechanisation of Wasm in Coq(Rocq)☆111Updated 3 weeks ago
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆150Updated 2 months ago
- ☆15Updated last year
- Formalization of C++ for verification purposes.☆85Updated last week
- Coq library for tactics, basic definitions, sets, maps☆49Updated last week
- Deadlock freedom by type checking☆20Updated 2 years ago
- Yet another plugin tutorial, this time as an exercise for 598☆38Updated 2 years ago
- Educational Proof Assistant for Type Theory☆81Updated last week
- Coq formalizations and proofs of (data) structures and algorithms.☆47Updated 7 years ago
- A Seamless, Interactive Tactic Learner and Prover for Coq☆78Updated this week
- Separation Logic Proofs in Lean☆45Updated 8 months ago
- Staged Abstract Interpreters☆68Updated 2 years ago
- ☆64Updated 3 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆67Updated last year
- being an operating system for typechecking processes☆130Updated 2 months ago
- Logical Relation for MLTT in Coq☆27Updated last week
- Benchmark repository of polyglot effect handler examples☆30Updated 3 months ago
- Genetic program repair using GHC☆33Updated last year
- Modeling and Proving in Computational Type Theory☆119Updated 4 months ago
- A mechanisation of Wasm in Isabelle.☆30Updated 2 weeks ago
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated last week
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆55Updated 4 years ago