Alternatives and similar repositories for clerical

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

• mortberg / gen-cart
  A Unifying Cartesian Cubical Set Model
  ☆35Updated 6 years ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated 2 months ago
• FrozenWinters / SSTs
  Work in progress on semi-simplicial types
  ☆23Updated 3 years ago
• kangxyz / cubical-classics
  An attempt towards univalent classical mathematics in Cubical Agda.
  ☆32Updated 2 years ago
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆24Updated last year
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated last week
• RedPRL / agda-mugen
  A formalization of the theory behind the mugen library
  ☆19Updated last year
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆29Updated 3 months ago
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆30Updated last week
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 7 years ago
• ToposInstitute / polytt
  A type theory with native support for Polynomial Functors.
  ☆41Updated 2 years ago
• favonia / hdtt2020-notes
  ☆38Updated 4 years ago
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆51Updated 3 years ago
• szumixie / stlc
  Simply-typed lambda calculus as a QIT in cubical Agda + normalization
  ☆15Updated 2 years ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 2 years ago
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆58Updated 2 months ago
• jonsterling / agda-stc
  Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.
  ☆20Updated 4 years ago
• AndrasKovacs / universes
  Generalized syntax & semantics for universe hierarchies
  ☆32Updated 2 years ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆43Updated last month
• ionathanch / parapoly
  A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"
  ☆32Updated last year
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆27Updated 3 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• ualib / ualib.github.io
  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
• rodrigogribeiro / unification
  Formalisation of a type unification algorithm in Coq proof assistant.
  ☆21Updated 7 years ago
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated 2 years ago
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆30Updated 3 years ago
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated 10 months ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆86Updated 4 years ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆82Updated 3 months ago