A thicker variant of Latin Modern Roman
☆15Jun 6, 2025Updated 9 months ago
Alternatives and similar repositories for fakebold
Users that are interested in fakebold are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Agda code for experimenting with internal models of cubical type theory☆15Apr 3, 2018Updated 7 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- Base library for HoTT in Agda☆39Apr 2, 2019Updated 6 years ago
- Category theory formalized in cubical agda☆21Feb 16, 2020Updated 6 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Aug 5, 2016Updated 9 years ago
- An interactive interpreter for asynchronous algebraic effects☆15Jun 19, 2024Updated last year
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- ☆12Jul 8, 2019Updated 6 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- being the beginnings of at least zero typecheckers☆34Apr 13, 2017Updated 8 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- Domain theory and denotational semantics in Coq☆10Dec 13, 2014Updated 11 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆20Jul 10, 2015Updated 10 years ago
- being an experiment with potato power☆23Jan 14, 2020Updated 6 years ago
- A discouraging story.☆17May 8, 2018Updated 7 years ago
- Collaborative work on reversible computing☆25Oct 30, 2021Updated 4 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated 2 months ago
- being some experiments, working towards some equipment I wish I had☆37Feb 3, 2016Updated 10 years ago
- A playground for type theory implementations in Racket☆20Dec 2, 2015Updated 10 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Dec 15, 2016Updated 9 years ago
- Relative Monad Library for Agda☆24May 29, 2019Updated 6 years ago
- Collaborative work on reversible computing☆18Aug 3, 2022Updated 3 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 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…☆16Jun 8, 2025Updated 9 months ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- Haskell geometry library☆17Mar 15, 2020Updated 6 years ago
- Type safe abstract binding trees for Haskell, using Vinyl☆16Oct 1, 2017Updated 8 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Dec 5, 2024Updated last year
- The original Edinburgh LCF.☆34Oct 21, 2016Updated 9 years ago
- Accompanying code for "Types and Programming Languages", ported to Standard ML☆30Jul 10, 2015Updated 10 years ago
- ☆28Jun 18, 2020Updated 5 years ago
- ☆12Jan 25, 2022Updated 4 years ago
- A formalized proof of a version of the initiality conjecture☆45Sep 10, 2020Updated 5 years ago
- Revised Omega-categorical Typechecker☆27Nov 3, 2024Updated last year