jagd / fakeboldLinks
A thicker variant of Latin Modern Roman
☆16Updated 7 months ago
Alternatives and similar repositories for fakebold
Users that are interested in fakebold are comparing it to the libraries listed below
Sorting:
- Typeset version of EGA and SGA by Grothendieck.☆12Updated 11 years ago
- HoTT group project to TeXify Cartmell's PhD thesis “Generalised Algebraic Theories and Contextual Categories”☆17Updated last week
- Agda code for experimenting with internal models of cubical type theory☆15Updated 7 years ago
- Experiments in Synthetic Differential Geometry☆16Updated 4 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 7 months ago
- Agda formalization of the paper, "Higher-Order Functions and Brouwer's Thesis". Deduces a Brouwer ordinal from a function ((nat -> nat) -…☆13Updated 5 years ago
- ☆17Updated 3 years ago
- ☆21Updated 4 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Lecture notes and exercises for the advanced course on Categorical Realizability at the Midlands Graduate School (MGS) 2024 and the Europ…☆23Updated 5 months ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 2 months ago
- ☆14Updated 4 months ago
- ☆11Updated 5 years ago
- A formalization of Constructive Projective Geometry in Agda☆12Updated 6 years ago
- Syntax for Virtual Equipments: a natural syntax for doing synthetic and internal category theory☆32Updated 2 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- ☆21Updated 3 years ago
- ☆14Updated last year
- Template to effortlessly build math-rich websites☆39Updated 4 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 6 years ago
- ☆12Updated 3 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14Updated 8 years ago
- ☆24Updated 2 months ago
- ☆15Updated 2 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month
- A Model of Relationally Parametric System F in Coq☆22Updated 10 years ago
- ☆18Updated 3 years ago
- Quasi-quoting library for agda☆18Updated last year
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago