A verified, modern, hardened memory allocator. [maintainer=@cmovcc]
☆45Jan 24, 2026Updated last month
Alternatives and similar repositories for StarMalloc
Users that are interested in StarMalloc are comparing it to the libraries listed below
Sorting:
- an encoding of affine effect handlers using pthreads☆14Nov 15, 2022Updated 3 years ago
- Linearizability Hoare Logic☆17Feb 9, 2026Updated last month
- The Steel separation logic library for F*☆37Nov 24, 2025Updated 3 months ago
- Coq plugin for extracting Rust code☆19Mar 2, 2026Updated 2 weeks ago
- PLT Redex models of LVar calculi☆10Apr 6, 2015Updated 10 years ago
- An OCaml extension for RISC-V☆16Nov 6, 2020Updated 5 years ago
- Implementation of the Delta Language☆13Mar 18, 2024Updated 2 years ago
- Functions and proofs about game trees in Rocq, implemented as rose trees.☆16Mar 10, 2026Updated last week
- Effects-based OCaml Nameserver☆40Dec 3, 2025Updated 3 months ago
- A SKI combinators interpreter written in assembly☆20Jul 25, 2020Updated 5 years ago
- A OCaml generator for well-typed terms (that use their arguments).☆11Feb 22, 2025Updated last year
- ☆17Apr 4, 2024Updated last year
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12May 1, 2024Updated last year
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆23Jan 28, 2026Updated last month
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- ☆12Jun 13, 2023Updated 2 years ago
- A Lévy-optimal lambda calculus reducer with a backdoor to C☆44Updated this week
- The Cambridge Haskell Supercompiler: an extension of "Supercompilation by Evaluation"☆24Mar 30, 2011Updated 14 years ago
- A formalisation of the Calculus of Constructions☆70Jul 24, 2024Updated last year
- A formalization of System Fω in Agda☆20Dec 23, 2025Updated 2 months ago
- 🦖 Implementations of various type inference algorithms. The new project is now at https://github.com/cu1ch3n/type-inference-zoo-frontend…☆154Jun 22, 2025Updated 8 months ago
- ☆15Aug 3, 2025Updated 7 months ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Sep 15, 2023Updated 2 years ago
- Wireshark dissector for the Nix daemon protocol.☆14Sep 11, 2025Updated 6 months ago
- toy implementation of Hindley-Milner type system that prints out inference steps☆17Oct 26, 2025Updated 4 months ago
- Implementation of a language interpreter in the browser, using js_of_ocaml.☆15Dec 25, 2017Updated 8 years ago
- OCaml hacking ideas, small and large.☆20Apr 9, 2024Updated last year
- A toy ELF parser/validator☆15Dec 18, 2024Updated last year
- Deciding Presburger arithmetic in agda☆33Mar 25, 2023Updated 2 years ago
- An extension of the NbE algorithm to produce computational traces☆22May 5, 2022Updated 3 years ago
- A formalization of M-types in Agda☆36Mar 7, 2020Updated 6 years ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Apr 3, 2023Updated 2 years ago
- CN separation logic refinement type system for C☆46Mar 12, 2026Updated last week
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 5 months ago
- For Jar artifacts☆20Nov 8, 2025Updated 4 months ago
- Interactive holes for Lean 4☆22Apr 19, 2024Updated last year
- Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.☆11Aug 28, 2024Updated last year
- A Collection of Papers & Notes in Programming Language & Formal Verification☆17May 10, 2022Updated 3 years ago