A verified, modern, hardened memory allocator. [maintainer=@cmovcc]
☆44Jan 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:
- Linearizability Hoare Logic☆17Feb 9, 2026Updated 2 weeks ago
- an encoding of affine effect handlers using pthreads☆14Nov 15, 2022Updated 3 years ago
- The Steel separation logic library for F*☆36Nov 24, 2025Updated 3 months ago
- Functions and proofs about game trees in Rocq, implemented as rose trees.☆13Dec 2, 2025Updated 2 months ago
- A OCaml generator for well-typed terms (that use their arguments).☆11Feb 22, 2025Updated last year
- A SKI combinators interpreter written in assembly☆20Jul 25, 2020Updated 5 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆23Jan 28, 2026Updated last month
- ☆12Jun 13, 2023Updated 2 years ago
- Effects-based OCaml Nameserver☆39Dec 3, 2025Updated 2 months ago
- Coq plugin for extracting Rust code☆18Dec 15, 2025Updated 2 months ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12May 1, 2024Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- Implementation of the Delta Language☆13Mar 18, 2024Updated last year
- ☆15Aug 3, 2025Updated 6 months ago
- ☆17Apr 4, 2024Updated last year
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- A formalization of System Fω in Agda☆20Dec 23, 2025Updated 2 months ago
- A formalisation of the Calculus of Constructions☆70Jul 24, 2024Updated last year
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Sep 15, 2023Updated 2 years 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
- being a particular fragment of Haskell, extended to a proof system☆43Dec 2, 2025Updated 2 months ago
- A formalization of M-types in Agda☆36Mar 7, 2020Updated 5 years ago
- An extension of the NbE algorithm to produce computational traces☆22May 5, 2022Updated 3 years ago
- Martin-Löf type theory + W-types implemented in C (WIP)☆27Feb 16, 2026Updated last week
- Graded Dependent Type systems☆25Jun 28, 2023Updated 2 years ago
- Interactive holes for Lean 4☆22Apr 19, 2024Updated last year
- A Lévy-optimal lambda calculus reducer with a backdoor to C☆43Updated this week
- Complexity analysis in Lean☆10Feb 5, 2024Updated 2 years ago
- ☆12Mar 13, 2025Updated 11 months ago
- Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]☆69Sep 17, 2024Updated last year
- Logical Relation for MLTT in Coq☆29Jan 14, 2026Updated last month
- Class instances for Coq inductive types with little boilerplate☆27Updated this week
- Tiny verified SAT-solver☆30Jan 7, 2022Updated 4 years ago
- The Cambridge Haskell Supercompiler: an extension of "Supercompilation by Evaluation"☆23Mar 30, 2011Updated 14 years ago
- PLT Redex models of LVar calculi☆10Apr 6, 2015Updated 10 years ago
- Lean 4 library of tools for parsing and compiling syntax and parser definitions.☆16Dec 10, 2023Updated 2 years ago
- A programming language that deduces code from tests☆30Jan 8, 2018Updated 8 years ago
- A new extraction system from Rocq to functional-style, memory-safe, thread-safe, readable, valid, performant, and modern C++.☆104Updated this week
- A constraint solver built from scratch in OCaml☆12Dec 10, 2021Updated 4 years ago