bbentzen / mpl
A Henkin-style completeness proof for the modal logic S5
☆13Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for mpl
- ☆27Updated last year
- A Logical Relation for Martin-Löf Type Theory in Agda☆45Updated 2 months ago
- Experiments with Realizability in Univalent Type Theory☆17Updated last month
- Mechanizations of Type Theories☆27Updated last week
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆23Updated 2 years ago
- Organize mathematical thoughts☆19Updated last year
- Logical Relation for MLTT in Coq☆19Updated last week
- Experiments with higher-order abstract syntax in Agda☆19Updated 2 years ago
- ☆17Updated 9 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 7 months ago
- ☆14Updated 8 months ago
- Algebraic proof discovery in Agda☆32Updated 2 years ago
- Extensions to the cubical stdlib category theory for categorical logic/type theory☆25Updated 2 weeks ago
- Generalized syntax & semantics for universe hierarchies☆28Updated 11 months ago
- ☆17Updated 2 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Notes (and implementation) of unification with binders☆14Updated last month
- ☆12Updated 5 months ago
- a version of the 2048 game for Coq☆22Updated last year
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆19Updated 2 years ago
- ☆21Updated 3 years ago
- ☆13Updated this week
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆14Updated 11 years ago
- Congruence Closure Procedure in Cubical Agda☆16Updated 4 years ago
- Research material of Erik Palmgren (1963–2019)☆20Updated last year
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 3 years ago
- A type theory with native support for Polynomial Functors.☆38Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 4 years ago