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 last year
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated last week
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆70Updated 6 months ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated last year
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆27Updated 3 years ago
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated last year
• AndrasKovacs / normalization-bench
  Lambda normalization and conversion checking benchmarks for various implementations
  ☆59Updated 4 years ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• duo-lang / duo-lang
  Duo - A research language exploring duality in programming language design
  ☆57Updated 2 years ago
• gelisam / typechecker-combinators
  ☆17Updated last year
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated 11 months ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated 3 weeks ago
• lexa-lang / lexa
  ☆36Updated last week
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 3 years ago
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆19Updated 6 months ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆54Updated 4 years ago
• RedPRL / mugen
  ♾️ A library for universe levels and universe polymorphism
  ☆34Updated last week
• RedPRL / kado
  🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory
  ☆21Updated last week
• favonia / hdtt2020-notes
  ☆36Updated 3 years ago
• Guest0x0 / trebor
  an implementation of Observational Type Theory (OTT) and more
  ☆27Updated 2 years ago
• xnning / MpEff
  Efficient effect handlers based on Evidence Passing Semantics.
  ☆31Updated 4 years ago
• ionathanch / TTBFL
  A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.
  ☆20Updated 3 months ago
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆75Updated 3 months ago
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆30Updated 2 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago
• AndrasKovacs / 2ltt-impl
  Eventually a practical 2-level TT-based compiler
  ☆27Updated 3 weeks ago
• sergei-romanenko / agda-simple-scp
  A simple supercompiler formally verified in Agda
  ☆34Updated 8 years ago