andrejbauer / formalized-mathematics-in-leanLinks
A graduate course on formalized mathematics at the Faculty of Mathematics and Physics, University of Ljubljana, Fall semester 2024/25
☆25Updated 6 months ago
Alternatives and similar repositories for formalized-mathematics-in-lean
Users that are interested in formalized-mathematics-in-lean are comparing it to the libraries listed below
Sorting:
- A type theory with native support for Polynomial Functors.☆39Updated last year
- A Seamless, Interactive Tactic Learner and Prover for Coq☆72Updated last week
- 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
- Type Checking in Lean 4☆28Updated last week
- The Agda Universal Algebra Library (html docs available at the url below)☆35Updated 7 months ago
- formalization of an equivariant cartesian cubical set model of type theory☆20Updated 6 months ago
- VSCode support for Forester☆21Updated last month
- A rosetta stone for metaprogramming in Coq, with different examples of tactics, plugins, etc implemented in different metaprogramming lan…☆17Updated last year
- A Testing Framework for Lean☆57Updated 3 months ago
- Denotational Semantics of the Untyped Lambda Calculus☆17Updated 5 months ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆30Updated last year
- A Lean 4 formalization of partial combinatory algebras.☆14Updated 6 months ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆51Updated 3 weeks ago
- Lecture notes on realizability☆74Updated 4 months ago
- ☆48Updated last month
- ☆36Updated 3 years ago
- high-performance cubical evaluation☆74Updated 2 months ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- CS410 "Advanced Functional Programming"☆25Updated 2 months ago
- Organize mathematical thoughts☆20Updated last year
- Reference sheet for people who know Lean 3 and want to write tactic-based proofs in Lean 4☆27Updated 8 months ago
- ♾️ A library for universe levels and universe polymorphism☆34Updated 7 months ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated last year
- being a particular fragment of Haskell, extended to a proof system☆32Updated 4 months ago
- Probabilistic separation logics for verifying higher-order probabilistic programs.☆25Updated this week
- Logical Relation for MLTT in Coq☆26Updated last week
- ☆12Updated 4 months ago
- ☆29Updated 2 years ago
- A toy example of a verified compiler.☆28Updated 2 months ago
- ☆17Updated last year