Linearizability Hoare Logic
☆17Feb 9, 2026Updated last month
Alternatives and similar repositories for LHL
Users that are interested in LHL are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12May 1, 2024Updated last year
- The Delphin Project☆10Aug 19, 2016Updated 9 years ago
- ☆16Apr 19, 2022Updated 3 years ago
- Martin-Löf type theory + W-types implemented in C (WIP)☆27Feb 16, 2026Updated last month
- A simple interpreter featuring a tracing JIT☆16Mar 28, 2011Updated 14 years ago
- A prototype for a monadic program logic in Lean that has since been upstreamed into the Lean 4 repo☆37Jun 27, 2025Updated 8 months ago
- a self-hosting lambda calculus compiler☆37Mar 31, 2025Updated 11 months ago
- an encoding of affine effect handlers using pthreads☆14Nov 15, 2022Updated 3 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
- Implementation of dependent type theory in SWI-Prolog☆10Oct 6, 2020Updated 5 years ago
- ☆12Feb 11, 2019Updated 7 years ago
- An experimental language server for SomewhatML☆24Dec 30, 2022Updated 3 years ago
- A SKI combinators interpreter written in assembly☆20Jul 25, 2020Updated 5 years ago
- ☆14Dec 9, 2022Updated 3 years ago
- ☆12Jun 13, 2023Updated 2 years ago
- ☆17Apr 4, 2024Updated last year
- A simple functional programming language.☆22Jun 3, 2021Updated 4 years ago
- ☆15Aug 3, 2025Updated 7 months ago
- A formalization of the theory behind the mugen library☆19Jun 24, 2024Updated last year
- A formal consistency proof of Quine's set theory New Foundations☆81Feb 25, 2026Updated 3 weeks ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆31Mar 6, 2026Updated 2 weeks ago
- The Cambridge Haskell Supercompiler: an extension of "Supercompilation by Evaluation"☆24Mar 30, 2011Updated 14 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- being a particular fragment of Haskell, extended to a proof system☆43Mar 2, 2026Updated 3 weeks ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Feb 26, 2024Updated 2 years ago
- dependent type theory experiment☆26Mar 1, 2024Updated 2 years ago
- ♾️ A library for universe levels and universe polymorphism☆37Nov 21, 2025Updated 4 months ago
- A proof tree viewer that works with Coq through Proof General☆28Jan 29, 2021Updated 5 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆32Jan 11, 2022Updated 4 years ago
- A formalization of System Fω in Agda☆20Dec 23, 2025Updated 3 months 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
- A Henkin-style completeness proof for the modal logic S5☆17Jun 20, 2021Updated 4 years ago
- A verified, modern, hardened memory allocator. [maintainer=@cmovcc]☆45Jan 24, 2026Updated last month
- Interactive holes for Lean 4☆22Apr 19, 2024Updated last year
- The MLPolyR programming language, revived☆25Oct 15, 2020Updated 5 years ago
- ☆14Feb 26, 2024Updated 2 years ago
- Pure relational SKI combinator calculus interpreter.☆11Jul 13, 2017Updated 8 years ago
- Domain specific language (DSL) and system for specifying, programming, and reasoning about packet-switched networks☆30Updated this week
- The Steel separation logic library for F*☆37Nov 24, 2025Updated 3 months ago