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
- 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
- being an implementation of the calculus of constructions☆17Mar 9, 2023Updated 3 years ago
- Verified decision procedures for modal logics in Lean☆12Jun 13, 2020Updated 5 years ago
- Linearizability Hoare Logic☆17Feb 9, 2026Updated last month
- ☆17Apr 4, 2024Updated last year
- Formalize "Logic Notes" by Lou van den Dries in Lean☆12May 31, 2025Updated 9 months ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆15Feb 26, 2024Updated 2 years ago
- Formalization of Arithmetization of Mathematics/Metamathematics☆13Mar 8, 2025Updated 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
- ☆12Jan 25, 2022Updated 4 years ago
- An extension of the NbE algorithm to produce computational traces☆22May 5, 2022Updated 3 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
- Agda to C compiler☆10Sep 23, 2025Updated 5 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆23Jan 28, 2026Updated last month
- Interactive holes for Lean 4☆22Apr 19, 2024Updated last year
- An implementation of a simple Neural network in Idris using category theory.☆25Sep 18, 2024Updated last year
- Interactive Theorem Proving for students☆21Aug 26, 2023Updated 2 years ago
- formally and easily, describe the semantics.☆13Aug 17, 2020Updated 5 years ago
- A small NuPRL style proof assistant☆31Jan 31, 2019Updated 7 years ago
- Automated Reasoning for the Working Mathematician☆11Aug 30, 2019Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- A SKI combinators interpreter written in assembly☆20Jul 25, 2020Updated 5 years ago
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆22Nov 20, 2025Updated 4 months ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Sep 15, 2023Updated 2 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 6 months ago
- an encoding of affine effect handlers using pthreads☆14Nov 15, 2022Updated 3 years ago
- Inefficient and syntactically unwieldy implementation of algebraic effects in Python using generators☆13Aug 31, 2020Updated 5 years ago
- Pure relational SKI combinator calculus interpreter.☆11Jul 13, 2017Updated 8 years ago
- an experiment in presenting code.☆14Aug 11, 2020Updated 5 years ago
- Hintikka's World is a pedagogical tool for learning modal logic, more precisely epistemic modal logic.☆12Oct 26, 2025Updated 4 months ago
- A 2D platformer in Idris, a dependently-typed purely functional programming language☆25Jul 3, 2020Updated 5 years ago
- ☆14Jun 7, 2024Updated last year
- Experiments with Realizability in Univalent Type Theory☆19Oct 21, 2024Updated last year
- the reflective tower Blond by Olivier Danvy & Karoline Malmkjær☆16May 21, 2025Updated 10 months ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- A programming language☆11Jan 7, 2022Updated 4 years ago