MPLLang / parallel-ml-benchLinks
Parallel ML benchmark suite
☆20Updated 3 weeks ago
Alternatives and similar repositories for parallel-ml-bench
Users that are interested in parallel-ml-bench are comparing it to the libraries listed below
Sorting:
- A deterministic parser with fused lexing☆75Updated 2 years ago
- A monadic library for symbolic evaluation☆73Updated 5 months ago
- Benchmark repository of polyglot effect handler examples☆32Updated 4 months ago
- Deadlock freedom by type checking☆20Updated 2 years ago
- Tutorial for using the MPL compiler for Parallel ML☆23Updated 11 months ago
- Gallina to Bedrock2 compilation toolkit☆65Updated 2 weeks ago
- Finite sets and maps for Coq with extensional equality☆30Updated last month
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- Formalization of CBPV extended with effect and coeffect tracking☆14Updated last year
- ☆56Updated 2 weeks ago
- Tiny verified SAT-solver☆30Updated 3 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 8 months ago
- Yet another plugin tutorial, this time as an exercise for 598☆38Updated 2 years ago
- Relation algebra library for Coq☆49Updated 3 weeks ago
- Rocqet proof language☆27Updated 4 months ago
- Coq & Haskell code for Calculating Correct Compilers II☆12Updated 3 years ago
- Constructive Galois connections☆36Updated 7 years ago
- A proof of Abel-Ruffini theorem.☆30Updated 2 months ago
- ☆42Updated 4 months ago
- Coq library for tactics, basic definitions, sets, maps☆51Updated 2 weeks ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated last week
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Updated 9 years ago
- Proof Updater Mechanically Passing Knowledge Into New Proofs, Assisting The Coq Hacker☆52Updated last year
- We define a simple programming language, simp_lang, then instantiate Iris to verify simple simp_lang programs with concurrent separation …☆56Updated 5 months ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated last week
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- EGraphs in OCaml☆78Updated last year
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 9 months ago
- A parser based on the ALL(*) algorithm, implemented and verified in Coq.☆13Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago