ehatti / LHLLinks
Linearizability Hoare Logic
☆14Updated 3 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
- ☆17Updated last year
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Updated 3 years ago
- A toy dependent typed language.☆29Updated last week
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆15Updated last year
- A simple λProlog interpreter☆20Updated 3 years ago
- ☆17Updated last year
- A formalization of System Fω in Agda☆17Updated 4 months ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 9 months ago
- dependent type theory experiment☆26Updated last year
- Experiments with Cubical Agda☆11Updated 3 weeks ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22Updated 4 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆14Updated last year
- 🩺 A library for compiler diagnostics☆46Updated 4 months ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆20Updated 8 months ago
- 🪆 A Staged Type Theory☆35Updated last year
- The Pulse separation logic DSL for F*☆20Updated last week
- Work in progress on semi-simplicial types☆23Updated 2 years ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- A simple functional programming language.☆21Updated 4 years ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Experimental type-checker for internally parametric type theory☆32Updated 2 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆19Updated last month
- a self-hosting lambda calculus compiler☆35Updated 2 months ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- Unofficial repository for the experimental porting of mathlib into lean4☆10Updated 4 years ago
- Sokoban implementation in lean for proving solvability / unsolvability☆13Updated 4 years ago
- A SKI combinators interpreter written in assembly☆20Updated 4 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆29Updated this week