TiarkRompf / reachabilityLinks
☆54Updated 3 months ago
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.☆46Updated 11 months ago
- A mechanisation of Wasm in Coq(Rocq)☆114Updated this week
- A monadic library for symbolic evaluation☆73Updated 6 months ago
- PL conference deadline countdowns☆65Updated 2 weeks ago
- A deterministic parser with fused lexing☆75Updated 2 years ago
- Best of POPL (BOP) Reading Group Memoirs☆67Updated 4 years ago
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆58Updated 7 months ago
- Educational Proof Assistant for Type Theory☆80Updated 3 weeks ago
- Coq library for tactics, basic definitions, sets, maps☆51Updated last week
- ☆42Updated 5 months ago
- A mechanisation of Wasm in Isabelle.☆32Updated 3 weeks ago
- Formalization of CBPV extended with effect and coeffect tracking☆14Updated last year
- Finite sets and maps for Coq with extensional equality☆30Updated 3 weeks ago
- Gallina to Bedrock2 compilation toolkit☆65Updated this week
- A Seamless, Interactive Tactic Learner and Prover for Coq☆82Updated this week
- Convert Haskell source code to Coq source code.☆93Updated 7 months ago
- EGraphs in OCaml☆80Updated 2 years ago
- Staged Abstract Interpreters☆69Updated 2 years ago
- A cost-aware logical framework, embedded in Agda.☆74Updated 3 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆69Updated last year
- ☆15Updated last year
- Formalization of C++ for verification purposes.☆90Updated this week
- being an operating system for typechecking processes☆130Updated 4 months ago
- Separation Logic Proofs in Lean☆47Updated last week
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆150Updated 4 months ago
- Deadlock freedom by type checking☆20Updated 2 years ago
- ☆70Updated 5 months ago
- Refreshing automation for inductive equational proofs using e-graphs☆24Updated last year
- ♾️ A library for universe levels and universe polymorphism☆36Updated 2 months ago
- A formalisation of the Calculus of Constructions☆70Updated last year