exaexa / better-mff-thesis
A slightly improved variant of the official thesis sample
☆28Updated last year
Alternatives and similar repositories for better-mff-thesis
Users that are interested in better-mff-thesis are comparing it to the libraries listed below
Sorting:
- ☆9Updated last year
- Supplementary materials for the course of "Concepts of Modern Programming Languages" (NPRG014) taught at Charles University, Prague, Czec…☆24Updated 5 months ago
- A Docker 🐳 container with CUNI.CZ PDF/A validation profile☆13Updated 10 months ago
- A graphical editor for graph-like structures☆98Updated last year
- The agda-unimath library☆253Updated this week
- HoTTEST Summer School materials☆297Updated last year
- ☆114Updated 10 months ago
- A Lean file formatter☆67Updated 2 years ago
- Attracting mathematicians (others welcome too) with no experience in proof verification interested in HoTT and able to use Agda for HoTT☆127Updated last year
- This project converts structured Lean code into an interactive browser game.☆76Updated last year
- Purely-functional, coordinate-free linear algebra☆28Updated last month
- A gamification of the theorems in MATH40002 Analysis 1☆82Updated 2 years ago
- Play/learn/work with me☆105Updated last week
- Accelerated machine learning with dependent types☆95Updated this week
- EPIT 2020 - Spring School on Homotopy Type Theory☆105Updated 3 years ago
- Data Parallel Programming☆22Updated last year
- Interactive dimensionality reduction for large datasets☆20Updated last year
- Examples of Dependently-typed programs in Haskell☆304Updated 2 years ago
- An interactive theorem prover for string diagrams☆115Updated 6 months ago
- Effective Algebraic Topology in Haskell☆90Updated 8 months ago
- agda-mode for neovim☆155Updated last week
- Mathlib search tool☆86Updated last week
- How I start Haskell.☆100Updated 7 months ago
- Overview of tactics in Lean 4 for beginners — longer version☆81Updated 7 months ago
- Categorical Logic Notes☆78Updated 3 years ago
- Schemes in Lean (v2)☆43Updated 4 years ago
- An experimental proof assistant based on a type theory for synthetic ∞-categories.☆224Updated 2 months ago
- Learn the Agda basics in three 2-hour sessions.☆56Updated last year
- A Haskell probabilistic programming library.☆19Updated 2 weeks ago
- Fast equality saturation in Haskell☆84Updated 2 months ago