Alternatives and similar repositories for nanoda

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

• hubris-lang / hubris
  A dependently typed programming language, and verification tool
  ☆27Updated 9 years ago
• jonsterling / coq-guarded-computational-type-theory
  ☆21Updated 7 years ago
• slasser / vermillion
  LL(1) parser generator verified in Coq
  ☆47Updated 5 years ago
• m-yac / tt-in-cagda
  Simply typed lambda calculus in cubical agda
  ☆22Updated 5 years ago
• brendanzab / rust-nbe-for-mltt
  Normalization by evaluation for Martin-Löf Type Theory with dependent records
  ☆99Updated 3 years ago
• pedrotst / coquedille
  A Coq to Cedille compiler written in Coq
  ☆34Updated 5 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆29Updated 10 months ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• kai-qu / linear-logic
  An encoding of linear logic in Coq with minimal Sokoban and blocks world examples
  ☆22Updated 3 years ago
• rocq-community / dblib
  Coq library for working with de Bruijn indices [maintainer=@KevOrr]
  ☆31Updated 4 years ago
• JoeyEremondi / lambda-pi-constraint
  ☆16Updated 8 months ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• unicoq / unicoq
  An enhanced unification algorithm for Coq
  ☆56Updated 6 months ago
• hazelgrove / hazelnut-dynamics-agda
  mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics
  ☆21Updated last year
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆82Updated last week
• aspiwack / peppermint-prover
  Experimental proof assistant (and architecture) for dependent linear logic
  ☆49Updated 3 years ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 4 years ago
• jozefg / blott
  An experimental type checker for a modal dependent type theory.
  ☆115Updated 5 years ago
• umazalakain / typing-linear-pi
  Typing the linear pi calculus in Agda
  ☆29Updated 3 years ago
• andrejbauer / clerical
  Command-like expressions for real infinite-precision calculations
  ☆54Updated 2 months ago
• pigworker / potato
  being an experiment with potato power
  ☆23Updated 5 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 5 years ago
• tsung-ju / SystemF
  An Agda formalization of System F and the Brown-Palsberg self-interpreter
  ☆26Updated 5 years ago
• gallais / typing-with-leftovers
  Self-contained repository for the eponymous paper
  ☆30Updated 6 years ago
• cedille / cedille-developments
  A showcase of interesting code and proof developments in Cedille
  ☆36Updated 4 months ago
• leanprover / tc
  Reference type checker for the Lean theorem prover
  ☆64Updated 8 years ago
• maximedenes / coq-amd64
  ☆22Updated 9 years ago
• michaelsproul / dblib-linear
  Formalisation of the linear lambda calculus in Coq
  ☆10Updated 6 years ago
• ISANobody / sill
  ☆29Updated 10 years ago