ehatti / LHLLinks
Linearizability Hoare Logic
☆14Updated 6 months ago
Alternatives and similar repositories for LHL
Users that are interested in LHL are comparing it to the libraries listed below
Sorting:
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆11Updated last year
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Updated last year
- A formalization of System Fω in Agda☆19Updated 7 months ago
- ☆17Updated last year
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 4 months ago
- A SKI combinators interpreter written in assembly☆20Updated 5 years ago
- A simple λProlog interpreter☆20Updated 3 years ago
- a self-hosting lambda calculus compiler☆37Updated 5 months ago
- A compiler and runtime for normalizing the untyped λ-calculus☆32Updated 3 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆21Updated last month
- Interactive holes for Lean 4☆22Updated last year
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- A proof tree viewer that works with Coq through Proof General☆28Updated 4 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Formalization of type theory☆22Updated 4 years ago
- My Agda blog/lab/playground☆13Updated last week
- Dependently typed programming language written in Haskell☆22Updated 3 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated last week
- Experimental type-checker for internally parametric type theory☆32Updated 5 months ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 4 years ago
- Martin-Löf type theory + W-types implemented in C (WIP)☆25Updated last month
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- A dependent type theory with user defined data types☆47Updated 3 years ago
- A toy dependent typed language.☆32Updated 3 weeks ago
- Command-like expressions for real infinite-precision calculations☆54Updated last month
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆40Updated 4 years ago