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 2 months ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated 2 weeks ago
• favonia / hdtt2020-notes
  ☆36Updated 3 years ago
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆30Updated this week
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated last year
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• mortberg / gen-cart
  A Unifying Cartesian Cubical Set Model
  ☆34Updated 6 years ago
• FrozenWinters / SSTs
  Work in progress on semi-simplicial types
  ☆23Updated 2 years ago
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆56Updated 6 months ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆17Updated last week
• pigworker / Samizdat
  being bits and pieces I'm inclined to leave lying around
  ☆54Updated 3 months ago
• kangxyz / cubical-classics
  An attempt towards univalent classical mathematics in Cubical Agda.
  ☆32Updated 2 years ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 2 years ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆42Updated 2 months ago
• pedrotst / coquedille
  A Coq to Cedille compiler written in Coq
  ☆34Updated 5 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• RedPRL / agda-mugen
  A formalization of the theory behind the mugen library
  ☆19Updated last year
• alhassy / next-700-module-systems
  PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.
  ☆82Updated 3 years ago
• AndrasKovacs / system-f-omega
  System F-omega normalization by hereditary substitution in Agda
  ☆60Updated 6 years ago
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated last year
• jsiek / abstract-binding-trees
  Abstract binding trees (abstract syntax trees plus binders), as a library in Agda
  ☆78Updated last month
• hide-kawabata / traf
  A proof tree viewer that works with Coq through Proof General
  ☆28Updated 4 years ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆47Updated 5 years ago
• umazalakain / typing-linear-pi
  Typing the linear pi calculus in Agda
  ☆29Updated 3 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• frex-project / agda-fragment
  Algebraic proof discovery in Agda
  ☆34Updated 3 years ago
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆19Updated 8 months ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• ToposInstitute / polytt
  A type theory with native support for Polynomial Functors.
  ☆39Updated 2 years ago