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.☆19Updated 2 months ago
- Notes (and implementation) of unification with binders☆14Updated 2 months ago
- being an implementation of the calculus of constructions☆17Updated 2 years ago
- being a particular fragment of Haskell, extended to a proof system☆32Updated 4 months ago
- Algebraic proof discovery in Agda☆34Updated 3 years ago
- Experiments with Realizability in Univalent Type Theory☆18Updated 8 months ago
- ☆15Updated last year
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- my phd thesis☆26Updated 11 months ago
- ☆13Updated 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…☆28Updated 2 years ago
- Verified Extraction from Rocq to OCaml/Malfunction☆13Updated last month
- Agda to C compiler☆10Updated 2 years ago
- Generalized syntax & semantics for universe hierarchies☆31Updated last year
- A type theory with native support for Polynomial Functors.☆39Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Multimode simple type theory as an Agda library.☆23Updated 9 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- ☆21Updated 3 years ago
- a version of the 2048 game for Coq☆22Updated last year
- ☆14Updated last year
- ☆17Updated 3 years ago
- formalization of an equivariant cartesian cubical set model of type theory☆20Updated 6 months ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- ☆29Updated 2 years ago
- A bare-bones LCF-style proof assistant☆24Updated 5 years ago
- ☆11Updated 5 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆25Updated 4 years ago
- Organize mathematical thoughts☆20Updated last year
- antifunext☆34Updated last year