Alternatives and similar repositories for n2o

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

• Chaaaos / formaltt
  Formalization of type theory
  ☆22Updated 4 years ago
• neel-krishnaswami / linearml
  A simple implementation of linear type theory
  ☆38Updated 8 years ago
• ilya-klyuchnikov / sc-mini
  SC Mini is a "minimal" positive supercompiler
  ☆48Updated 5 years ago
• hazelgrove / hazelnut-dynamics-agda
  mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics
  ☆21Updated last year
• evertedsphere / sound-and-complete
  An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system
  ☆84Updated 8 years ago
• hubris-lang / hubris
  A dependently typed programming language, and verification tool
  ☆27Updated 9 years ago
• bobatkey / foveran
  A Dependently Typed Programming Language
  ☆27Updated 5 years ago
• eayus / sirdi
  Package manager for Idris
  ☆37Updated 3 years ago
• hydrolarus / toml-idr
  A TOML parser for Idris 2
  ☆17Updated last year
• LightAndLight / sized-hkts
  Higher kinded polymorphism in a language with unboxed, statically sized datatypes.
  ☆51Updated last year
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated 2 years ago
• gallais / agda-sizedIO
  IO using sized types and copatterns
  ☆36Updated 4 years ago
• pigworker / potato
  being an experiment with potato power
  ☆23Updated 6 years ago
• Soonad / Formality-Core
  Specification of the Formality proof and programming language
  ☆41Updated 2 years ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆56Updated 3 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 4 years ago
• atennapel / coc-os
  "operating system" based on the calculus of constructions
  ☆18Updated 3 years ago
• langston-barrett / write-yourself-a-scheme-in-agda
  Like "Write Yourself a Scheme in 48 Hours", but in Agda
  ☆51Updated 7 years ago
• andgate / type-theory-compiler
  Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…
  ☆44Updated 6 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago
• robsimmons / abbot
  Generation of abstract binding trees
  ☆27Updated 4 months ago
• cedille / cedille-cast
  Source files used for the Cedille Cast videos
  ☆13Updated last month
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 5 years ago
• kcsmnt0 / quotient
  quotient types in cubical Agda
  ☆24Updated 6 years ago
• VictorTaelin / absal-rs
  ☆35Updated 7 years ago
• ioanluca / real-world-idris
  Malfunction backend for Idris with a FFI to OCaml
  ☆28Updated 6 years ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆41Updated 5 years ago
• effectfully / STLC
  Dependently typed Algorithm M and friends
  ☆26Updated 7 years ago
• dorchard / effects-as-sessions
  Formalised embedding of an imperative language with effect system into session-typed pi calculus.
  ☆29Updated last year