bbentzen / mplLinks
A Henkin-style completeness proof for the modal logic S5
☆17Updated 4 years ago
Alternatives and similar repositories for mpl
Users that are interested in mpl are comparing it to the libraries listed below
Sorting:
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆22Updated 8 months ago
- being a particular fragment of Haskell, extended to a proof system☆43Updated last month
- Algebraic proof discovery in Agda☆35Updated 4 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Updated 3 months ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆29Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- ☆15Updated 2 years ago
- Agda to C compiler☆10Updated 3 months ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Experiments with Realizability in Univalent Type Theory☆19Updated last year
- Revised Omega-categorical Typechecker☆27Updated last year
- Verified Extraction from Rocq to OCaml/Malfunction☆13Updated 7 months ago
- Building A Correct-By-Construction Proof Checkers For Type Theories☆29Updated 2 weeks ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Organize mathematical thoughts☆20Updated 2 years ago
- An experimental mutual induction tactic for Lean 4.☆22Updated 2 months ago
- my phd thesis☆26Updated last year
- ☆14Updated last year
- A type theory with native support for Polynomial Functors.☆41Updated 2 years ago
- Multimode simple type theory as an Agda library.☆23Updated last year
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- Deciding Presburger arithmetic in agda☆33Updated 2 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- ☆21Updated 4 years ago
- ☆21Updated 3 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- formalization of an equivariant cartesian cubical set model of type theory☆20Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- ☆17Updated last year