Alternatives and similar repositories for newt

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

• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated 2 years ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆36Updated last week
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆72Updated 9 months ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated 2 years ago
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated 2 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆27Updated 3 years ago
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• sweirich / rebound
  # A simple variable binding library based on well-scoped indices and environments
  ☆27Updated last month
• lexa-lang / lexa
  ☆41Updated 3 months ago
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆30Updated 3 years ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆32Updated 3 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆36Updated last week
• AndrasKovacs / 2ltt-impl
  Eventually a practical 2-level TT-based compiler
  ☆29Updated 3 weeks ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆58Updated last year
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆76Updated 7 months ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆54Updated 4 years ago
• frex-project / idris-frex
  ☆51Updated 3 months ago
• blntk / sfpl
  A simple functional programming language.
  ☆22Updated 4 years ago
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆20Updated 9 months ago
• FrozenWinters / SSTs
  Work in progress on semi-simplicial types
  ☆23Updated 2 years ago
• gelisam / typechecker-combinators
  ☆17Updated last year
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆61Updated 2 years ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• hkust-taco / superf
  Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…
  ☆15Updated last year
• RedPRL / kado
  🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory
  ☆20Updated last week
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated last year
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆61Updated last year