Beluga-lang / McTT
A bottom-up approach to a verified implementation of MLTT
☆15Updated this week
Related projects ⓘ
Alternatives and complementary repositories for McTT
- Mechanizations of Type Theories☆27Updated this week
- formalization of an equivariant cartesian cubical set model of type theory☆19Updated 3 months ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- Algebraic proof discovery in Agda☆32Updated 2 years ago
- Logical Relation for MLTT in Coq☆19Updated last week
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated 9 months ago
- Experiments with higher-order abstract syntax in Agda☆19Updated 2 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- ☆11Updated last month
- ☆27Updated last year
- ☆22Updated 2 weeks ago
- A type theory for tiny objects☆10Updated 11 months ago
- 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
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆14Updated 11 years ago
- A style guide for Coq☆17Updated 2 years ago
- antifunext☆28Updated 4 months ago
- ☆13Updated last year
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated 9 months ago
- A repository for material from the reading group on NbE☆17Updated last year
- A Logical Relation for Martin-Löf Type Theory in Agda☆45Updated last month
- Relation algebra library for Coq☆45Updated 3 weeks ago
- A graduate course on formalized mathematics at the Faculty of Mathematics and Physics, University of Ljubljana, Fall semester 2024/25☆20Updated this week
- Congruence Closure Procedure in Cubical Agda☆16Updated 4 years ago
- ☆21Updated 3 years ago
- ModTT in Agda☆11Updated 3 years ago
- ☆35Updated 2 weeks ago