A Henkin-style completeness proof for the modal logic S5
☆17Jun 20, 2021Updated 4 years ago
Alternatives and similar repositories for mpl
Users that are interested in mpl are comparing it to the libraries listed below
Sorting:
- ☆16Jan 4, 2021Updated 5 years ago
- Linearizability Hoare Logic☆17Feb 9, 2026Updated 3 weeks ago
- being an implementation of the calculus of constructions☆17Mar 9, 2023Updated 2 years ago
- Verified decision procedures for modal logics in Lean☆12Jun 13, 2020Updated 5 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
- ☆15Oct 31, 2023Updated 2 years ago
- ☆17Apr 4, 2024Updated last year
- A library for the next generation of LCF refiners, with support for dependent refinement—Long Live the Anti-Realist Struggle!☆16Feb 13, 2018Updated 8 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Feb 26, 2024Updated 2 years ago
- A SKI combinators interpreter written in assembly☆20Jul 25, 2020Updated 5 years ago
- An extension of the NbE algorithm to produce computational traces☆22May 5, 2022Updated 3 years ago
- Interactive holes for Lean 4☆22Apr 19, 2024Updated last year
- Interactive Theorem Proving for students☆21Aug 26, 2023Updated 2 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
- Formalization of Arithmetization of Mathematics/Metamathematics☆13Mar 8, 2025Updated 11 months ago
- A programming language☆11Jan 7, 2022Updated 4 years ago
- An implementation of a simple Neural network in Idris using category theory.☆24Sep 18, 2024Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- HW: a modern, open-source, typeless, turing-incomplete programming language.☆10Jul 17, 2018Updated 7 years ago
- Agda to C compiler☆10Sep 23, 2025Updated 5 months ago
- Inefficient and syntactically unwieldy implementation of algebraic effects in Python using generators☆13Aug 31, 2020Updated 5 years ago
- An imperative, statically-typed toy language☆12May 5, 2019Updated 6 years ago
- A programming language that deduces code from tests☆30Jan 8, 2018Updated 8 years ago
- A compiler for the Dana programming language☆11Apr 25, 2021Updated 4 years ago
- Formalize "Logic Notes" by Lou van den Dries in Lean☆12May 31, 2025Updated 9 months ago
- ☆12Jan 25, 2022Updated 4 years ago
- formally and easily, describe the semantics.☆13Aug 17, 2020Updated 5 years ago
- Tableau for basic modal logic in Lean 3 - This is OLD and not maintained. See https://github.com/m4lvin/lean4-pdl instead.☆13Oct 24, 2023Updated 2 years ago
- Verified compilation of space-efficient reversible circuits☆23Mar 5, 2019Updated 6 years ago
- An implementation of Colin James' "Compiling Lambda Calculus"☆16Sep 29, 2022Updated 3 years ago
- Formalising Turing Machines In Coq (bachelor's thesis)☆12Jul 5, 2023Updated 2 years ago
- an encoding of affine effect handlers using pthreads☆14Nov 15, 2022Updated 3 years ago
- Pure relational SKI combinator calculus interpreter.☆11Jul 13, 2017Updated 8 years ago
- ☆12Jun 13, 2023Updated 2 years ago
- Functions and proofs about game trees in Rocq, implemented as rose trees.☆13Dec 2, 2025Updated 2 months ago
- An esoteric language based on overlapping tree-like structures☆10Oct 16, 2021Updated 4 years ago
- An artificial life experiment.☆12Jul 30, 2020Updated 5 years ago
- an experiment in presenting code.☆14Aug 11, 2020Updated 5 years ago
- Verified Extraction from Rocq to OCaml/Malfunction☆14May 23, 2025Updated 9 months ago