Alternatives and similar repositories for computer-modern

Users that are interested in computer-modern are comparing it to the libraries listed below

• kuribas / hmetafont
  hmetafont is a DSL for creating variable fonts in haskell, inspired by metafont
  ☆11Updated 8 years ago
• jagd / fakebold
  A thicker variant of Latin Modern Roman
  ☆16Updated last month
• awswan / oraclemodality
  ☆14Updated last year
• msp-strath / Mary
  Mary is the successor of Marx, a content delivery and assessment engine based on markdown and git
  ☆17Updated last year
• TheoWinterhalter / phd-thesis
  Phd Thesis of Théo Winterhalter. Look at releases to get the latest PDF.
  ☆36Updated 4 years ago
• jespercockx / scope
  An agda2hs-compatible library for well-scoped syntax
  ☆11Updated last month
• lawcho / agda2c
  Agda to C compiler
  ☆10Updated 2 years ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆32Updated 4 months ago
• JorisCeulemans / sikkel
  Multimode simple type theory as an Agda library.
  ☆23Updated 9 months ago
• bbentzen / mpl
  A Henkin-style completeness proof for the modal logic S5
  ☆17Updated 4 years ago
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆19Updated 2 months ago
• VictorCMiraldo / agda-rw
  This is the place where (more or less) stable releases of my RW library will be published.
  ☆16Updated 5 years ago
• tomdjong / domain-theory-in-uf
  ☆11Updated 5 years ago
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆53Updated 2 weeks ago
• AndrasKovacs / thesis
  my phd thesis
  ☆26Updated 11 months ago
• gmalecha / coq-interaction-trees
  Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.
  ☆18Updated 7 years ago
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆54Updated 10 months ago
• peterlefanulumsdaine / palmgren-archive
  Research material of Erik Palmgren (1963–2019)
  ☆20Updated 3 months ago
• shinji-kono / zf-in-agda
  define ZF Set Theory in Agda and it's model on Ordinal and Ordinal Definable Set
  ☆14Updated 5 months ago
• wrengr / bytestring-trie
  An efficient finite map from (byte)strings to values.
  ☆20Updated 2 months ago
• danelahman / Normalization-By-Evaluation
  Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories
  ☆15Updated 12 years ago
• GuillermoCalderon / ProjectiveGeometryInAgda
  A formalization of Constructive Projective Geometry in Agda
  ☆13Updated 6 years ago
• punkdit / categories
  Archive of the categories mailling list
  ☆11Updated 4 years ago
• diagrams / diagrams-builder
  Utilities for creating diagram-building tools
  ☆13Updated 3 weeks ago
• wenkokke / msla2014
  wherein I implement several substructural logics in Agda
  ☆24Updated 6 years ago
• uemurax / synthetic-topos-theory
  ☆15Updated last year
• tomdjong / MGS-categorical-realizability
  Lecture notes and exercises for the advanced course on Categorical Realizability at the Midlands Graduate School (MGS) 2024 and the Europ…
  ☆19Updated last week
• SKolodynski / IsarMathLib
  IsarMathLib is a library of formalized mathematics for Isabelle/ZF.
  ☆18Updated last week
• MetaRocq / rocq-verified-extraction
  Verified Extraction from Rocq to OCaml/Malfunction
  ☆13Updated last month