Alternatives and similar repositories for konna

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

• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆30Updated 3 weeks ago
• LPTK / simpler-sub
  Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…
  ☆26Updated 3 years ago
• phase / dtt
  dependent type theory experiment
  ☆26Updated last year
• ehatti / LHL
  Linearizability Hoare Logic
  ☆14Updated 3 months ago
• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆53Updated 4 months ago
• thamugadi / semantic-preservation
  Attempt to prove semantic preservation (forward simulation) for a simple compiler.
  ☆11Updated last year
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 6 years ago
• rzrn / anders
  Anders: Cubical Type Checker
  ☆23Updated last year
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated 3 months ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆69Updated 4 months ago
• RedPRL / stagedtt
  🪆 A Staged Type Theory
  ☆35Updated last year
• andreypopp / type-systems
  Playing with type systems
  ☆51Updated 6 months ago
• ollef / system-f-omega-agda
  A formalization of System Fω in Agda
  ☆17Updated 4 months ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆60Updated last year
• vmchale / kempe
  Kempe is a compiled stack-based language
  ☆58Updated 9 months ago
• artagnon / bonak
  🧊 An indexed construction of semi-simplicial and semi-cubical sets
  ☆29Updated this week
• AshleyYakeley / Truth
  Changes and Pinafore projects. Pull requests not accepted.
  ☆34Updated last month
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆36Updated 2 weeks ago
• ayazhafiz / plts
  A collection of programming languages and type systems.
  ☆33Updated 2 months ago
• FrozenWinters / SSTs
  Work in progress on semi-simplicial types
  ☆23Updated 2 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• ucsd-progsys / mist
  A tiny language for teaching and experimenting with Refinement Types
  ☆47Updated 4 years ago
• RedPRL / algaett
  🦠 An experimental elaborator for dependent type theory using effects and handlers
  ☆37Updated last year
• gelisam / typechecker-combinators
  ☆17Updated last year
• mb64 / xtt
  A simple implementation of XTT, "A cubical language for Bishop sets"
  ☆27Updated 3 years ago
• LightAndLight / sized-hkts
  Higher kinded polymorphism in a language with unboxed, statically sized datatypes.
  ☆51Updated 5 months ago