Alternatives and similar repositories for dtt-rtcg

Users that are interested in dtt-rtcg are comparing it to the libraries listed below

• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆75Updated 5 months ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated 2 years ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆32Updated this week
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated last year
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• AndrasKovacs / 2ltt-impl
  Eventually a practical 2-level TT-based compiler
  ☆27Updated last week
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated last month
• effectfully / inference-in-agda
  A tutorial on how Agda infers things
  ☆61Updated 2 months ago
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated last year
• jespercockx / agda-core
  A work-in-progress core language for Agda, in Agda
  ☆55Updated last month
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆57Updated 2 years ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 2 years ago
• frex-project / idris-frex
  ☆48Updated last month
• marcusrossel / verified-compiler
  A toy example of a verified compiler.
  ☆29Updated 5 months ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• lexa-lang / lexa
  ☆37Updated last month
• msp-strath / TypOS
  being an operating system for typechecking processes
  ☆130Updated 2 years ago
• andrejbauer / notes-on-realizability
  Lecture notes on realizability
  ☆74Updated 7 months ago
• sweirich / lambda-n-ways
  Benchmarks for capture-avoiding substitution
  ☆120Updated 4 months ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆54Updated 4 years ago
• UChicago-PL / smyth
  Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.
  ☆55Updated 4 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated last week
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆61Updated last year
• FrozenWinters / stlc
  This aims to be the most pretentious implementation of stlc in existence
  ☆65Updated 3 years ago
• samuela / bidirectional-typing
  A bidirectional type checker
  ☆64Updated 8 years ago
• frex-project / agda-fragment
  Algebraic proof discovery in Agda
  ☆34Updated 3 years ago
• AndrasKovacs / staged
  Staged compilation with dependent types
  ☆182Updated 4 months ago
• msp-strath / ask
  being a particular fragment of Haskell, extended to a proof system
  ☆39Updated 2 months ago
• kangxyz / cubical-classics
  An attempt towards univalent classical mathematics in Cubical Agda.
  ☆32Updated 2 years ago