Alternatives and similar repositories for konna

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

• LPTK / simpler-sub
  Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…
  ☆27Updated 3 years ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆32Updated this week
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆32Updated 3 years ago
• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆61Updated this week
• ehatti / LHL
  Linearizability Hoare Logic
  ☆14Updated 6 months ago
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆11Updated last year
• phase / dtt
  dependent type theory experiment
  ☆26Updated last year
• hkust-taco / mlstruct
  Codebase for the paper "MLstruct: Principal Type Inference in a Boolean Algebra of Structural Types"
  ☆44Updated 9 months ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆37Updated 6 months ago
• meta-logic / lltp
  TPTP linear logic version
  ☆14Updated 8 months ago
• xnning / Consistent-Subtyping-for-All
  Haskell implementation and Coq proof for an implicit polymorphic gradual type system.
  ☆16Updated 5 years ago
• gelisam / typechecker-combinators
  ☆17Updated last year
• SomewhatML / sml-analyzer
  An experimental language server for SomewhatML
  ☆24Updated 2 years ago
• namin / higher-rank
  Practical type inference for arbitrary-rank types
  ☆11Updated 6 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆61Updated last year
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆37Updated this week
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆19Updated 7 months ago
• vmchale / kempe
  Kempe is a compiled stack-based language
  ☆58Updated last year
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• fir-lang / fir
  Fir programming language
  ☆75Updated this week
• Barry-Jay / bondi
  source code for the bondi programming language
  ☆41Updated 6 years ago
• AshleyYakeley / Truth
  Changes and Pinafore projects. Pull requests not accepted.
  ☆33Updated last week
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated last year
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆32Updated 6 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆47Updated 4 years ago
• mb64 / poly
  A WIP compiler for a functional language. Very incomplete!
  ☆16Updated 3 years ago
• jdan / compiler.lean
  A formally verified compiler for a simple language with numbers and sums
  ☆27Updated 4 years ago
• andreypopp / type-systems
  Playing with type systems
  ☆51Updated 9 months ago