Alternatives and similar repositories for clerical

Users that are interested in clerical are comparing it to the libraries listed below

• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated 3 weeks ago
• mortberg / gen-cart
  A Unifying Cartesian Cubical Set Model
  ☆34Updated 5 years ago
• favonia / hdtt2020-notes
  ☆36Updated 3 years ago
• FrozenWinters / SSTs
  Work in progress on semi-simplicial types
  ☆23Updated 2 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated this week
• kangxyz / cubical-classics
  An attempt towards univalent classical mathematics in Cubical Agda.
  ☆31Updated last year
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆29Updated 3 weeks ago
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated 11 months ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated last year
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆27Updated 3 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• RedPRL / agda-mugen
  A formalization of the theory behind the mugen library
  ☆19Updated last year
• L-TChen / BiSig
  Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically
  ☆21Updated last year
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 3 years ago
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆17Updated 2 weeks ago
• szumixie / stlc
  Simply-typed lambda calculus as a QIT in cubical Agda + normalization
  ☆14Updated last year
• frex-project / agda-fragment
  Algebraic proof discovery in Agda
  ☆34Updated 3 years ago
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated 5 months ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆31Updated last year
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆54Updated 11 months ago
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆19Updated 6 months ago
• pedrotst / coquedille
  A Coq to Cedille compiler written in Coq
  ☆34Updated 4 years ago
• hide-kawabata / traf
  A proof tree viewer that works with Coq through Proof General
  ☆28Updated 4 years ago
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆56Updated 4 months ago
• jonsterling / agda-stc
  Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.
  ☆19Updated 4 years ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆26Updated 4 years ago
• umazalakain / typing-linear-pi
  Typing the linear pi calculus in Agda
  ☆29Updated 3 years ago
• ericfinster / catt.io
  Revised Omega-categorical Typechecker
  ☆27Updated 9 months ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆47Updated 5 years ago