Alternatives and similar repositories for cctt

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

• RedPRL / mugen
  ♾️ A library for universe levels and universe polymorphism
  ☆34Updated 6 months ago
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆63Updated 3 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• favonia / hdtt2020-notes
  ☆36Updated 3 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• frex-project / idris-frex
  ☆47Updated 3 weeks ago
• andrejbauer / notes-on-realizability
  Lecture notes on realizability
  ☆72Updated 4 months ago
• thiagofelicissimo / BiTTs
  ☆25Updated 9 months ago
• AndrasKovacs / 2ltt-impl
  Eventually a practical 2-level TT-based compiler
  ☆27Updated 2 months ago
• math-comp / hierarchy-builder
  High level commands to declare a hierarchy based on packed classes
  ☆99Updated 2 weeks ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆69Updated 4 months ago
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆126Updated 2 years ago
• jespercockx / agda-core
  A work-in-progress core language for Agda, in Agda
  ☆52Updated last week
• DimaSamoz / agda-soas
  Agda formalisation of second-order abstract syntax
  ☆55Updated 2 years ago
• felixwellen / synthetic-zariski
  Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos
  ☆61Updated this week
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆114Updated 3 weeks ago
• HuStmpHrrr / mech-type-theories
  Mechanizations of Type Theories
  ☆30Updated 2 weeks ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• logsem / mitten_preorder
  ☆29Updated 2 years ago
• kangxyz / cubical-classics
  An attempt towards univalent classical mathematics in Cubical Agda.
  ☆30Updated last year
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated last year
• marcusrossel / verified-compiler
  A toy example of a verified compiler.
  ☆28Updated last month
• rzk-lang / sHoTT
  Formalisations for simplicial HoTT and synthetic ∞-categories.
  ☆50Updated 8 months ago
• rocq-community / autosubst
  Automation for de Bruijn syntax and substitution in Coq [maintainers=@RalfJung,@co-dan]
  ☆59Updated 9 months ago
• Guest0x0 / normalization-bench
  Benchmarking various normalization algorithms for the lambda calculus
  ☆45Updated 2 years ago
• emilyriehl / yoneda
  comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories
  ☆63Updated 8 months ago
• AndrasKovacs / antifunext
  antifunext
  ☆34Updated 11 months ago
• ayberkt / formal-topology-in-UF
  Formal Topology in Univalent Foundations (WIP).
  ☆36Updated 2 years ago
• mr-ohman / logrel-mltt
  A Logical Relation for Martin-Löf Type Theory in Agda
  ☆54Updated 9 months ago
• ammkrn / type_checking_in_lean4
  Type Checking in Lean 4
  ☆28Updated 2 weeks ago