Alternatives and similar repositories for Aptwe

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

• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated last year
• Chaaaos / formaltt
  Formalization of type theory
  ☆22Updated 4 years ago
• ionathanch / scraps
  Various mechanized proof files for fun.
  ☆13Updated last month
• ncfavier / agda-stuff
  My Agda blog/lab/playground
  ☆13Updated this week
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆40Updated 4 years ago
• hydrolarus / toml-idr
  A TOML parser for Idris 2
  ☆17Updated last year
• hazelgrove / hazelnut-dynamics-agda
  mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics
  ☆21Updated last year
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆27Updated 3 years ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆71Updated 7 months ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 5 months ago
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆11Updated last year
• RedPRL / agda-mugen
  A formalization of the theory behind the mugen library
  ☆19Updated last year
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆19Updated 7 months ago
• lexi-lambda / racket-mvar
  An implementation of Haskell’s MVars in Racket
  ☆30Updated 11 months ago
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆30Updated 3 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 4 years ago
• zanzix / idris-neural-net
  An implementation of a simple Neural network in Idris using category theory.
  ☆23Updated last year
• rzk-lang / sHoTT
  Formalisations for simplicial HoTT and synthetic ∞-categories.
  ☆51Updated 2 months ago
• mattia-furlan / MasterThesisCTT
  Haskell implementation of a version of cubical type theory developed for my master thesis
  ☆16Updated 2 years ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• sergei-romanenko / agda-simple-scp
  A simple supercompiler formally verified in Agda
  ☆34Updated 8 years ago
• JacquesCarette / Notes
  ☆13Updated last month
• sweirich / graded-haskell
  Graded Dependent Type systems
  ☆25Updated 2 years ago
• kcsmnt0 / quotient
  quotient types in cubical Agda
  ☆24Updated 6 years ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆32Updated 2 weeks ago
• ToposInstitute / polytt
  A type theory with native support for Polynomial Functors.
  ☆39Updated last year
• maxsnew / grammars-and-semantic-actions
  Intrinsic Verification of Formal Grammar Theory
  ☆26Updated last month
• ice1000 / agda-mode
  Accessing Agda's interaction mode via command line & external tactic for Agda.
  ☆26Updated 4 years ago
• rzk-lang / hottbook
  HoTT Book formalisations in Rzk.
  ☆19Updated last year
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated last month