jagd / fakeboldLinks
A thicker variant of Latin Modern Roman
☆16Updated 4 months ago
Alternatives and similar repositories for fakebold
Users that are interested in fakebold are comparing it to the libraries listed below
Sorting:
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆12Updated 5 years ago
- Using Forester, We are attempting to resurrect and grow the since deleted model theory wiki and give it a better foundation for future gr…☆16Updated 4 months ago
- Experiments in Synthetic Differential Geometry☆16Updated 4 years ago
- HoTT group project to TeXify Cartmell's PhD thesis “Generalised Algebraic Theories and Contextual Categories”☆17Updated 2 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- ☆12Updated 3 years ago
- Agda code for experimenting with internal models of cubical type theory☆15Updated 7 years ago
- ☆14Updated last month
- ☆14Updated last year
- ☆11Updated 5 years ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- ☆17Updated 2 weeks ago
- Typeset version of EGA and SGA by Grothendieck.☆12Updated 11 years ago
- Research material of Erik Palmgren (1963–2019)☆21Updated 6 months ago
- ☆17Updated 3 years ago
- my phd thesis☆26Updated last year
- ☆15Updated last year
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated last month
- Lecture notes and exercises for the advanced course on Categorical Realizability at the Midlands Graduate School (MGS) 2024 and the Europ…☆21Updated 2 months ago
- ☆18Updated 3 years ago
- Revised Omega-categorical Typechecker☆27Updated 11 months ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Updated 2 years ago
- A formalization of Constructive Projective Geometry in Agda☆12Updated 6 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Multimode simple type theory as an Agda library.☆23Updated last year
- ☆21Updated 4 years ago
- ☆21Updated 3 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago