Alternatives and similar repositories for datatt

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

• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆82Updated 3 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 3 years ago
• elpinal / modules
  Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modules
  ☆31Updated 2 years ago
• AndrasKovacs / setoidtt
  Prototype implementations of systems based on setoid type theory
  ☆65Updated 4 years ago
• WhatisRT / meta-cedille
  Minimalistic dependent type theory with syntactic metaprogramming
  ☆57Updated last year
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆22Updated 5 years ago
• FrozenWinters / SSTs
  Work in progress on semi-simplicial types
  ☆23Updated 2 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆59Updated last year
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆47Updated 5 years ago
• AndrasKovacs / implicit-fun-elaboration
  Implementation for ICFP 2020 paper
  ☆53Updated 3 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 6 years ago
• 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
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• andreasabel / miniagda
  A prototypical dependently typed languages with sized types and variances
  ☆109Updated 2 years ago
• balint99 / sfpl
  A simple functional programming language.
  ☆21Updated 4 years ago
• sergei-romanenko / agda-simple-scp
  A simple supercompiler formally verified in Agda
  ☆34Updated 8 years ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆29Updated this week
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆36Updated last month
• favonia / hdtt2020-notes
  ☆36Updated 3 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆35Updated 4 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆112Updated 5 years ago
• AndrasKovacs / sett
  Setoid type theory implementation
  ☆38Updated last year
• discus-lang / salt
  The compilation target that functional programmers always wanted.
  ☆62Updated 4 years ago
• frex-project / idris-frex
  ☆47Updated 2 weeks ago
• atennapel / coc-os
  "operating system" based on the calculus of constructions
  ☆18Updated 2 years ago
• ecavallo / ptt
  Experimental type-checker for internally parametric type theory
  ☆32Updated 2 months ago
• elpinal / modules-rs
  An interpreter of F-ing modules
  ☆19Updated 5 years ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated last year