Alternatives and similar repositories for rustie-ts:

Users that are interested in rustie-ts are comparing it to the libraries listed below

• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆52Updated 2 years ago
• RedPRL / algaeff
  🦠 Reusable components based on algebraic effects
  ☆49Updated 6 months ago
• argumentcomputer / Wasm.lean
  A WebAssembly implementation in Lean4
  ☆34Updated last year
• HigherOrderCO / Kindex
  Collection of Kind2 programs and proofs
  ☆11Updated 10 months ago
• matteo-meluzzi / agda2hvm
  ☆13Updated last year
• codedot / lambda
  Macro Lambda Calculus
  ☆49Updated 6 years ago
• euschn / ingpu
  GPU-based interaction nets evaluator
  ☆16Updated 13 years ago
• VictorTaelin / Taelang
  my personal lang
  ☆16Updated last year
• aripiprazole / trazodone
  🧪 | LLVM backend for HVM
  ☆23Updated last year
• VictorTaelin / ultimate-calculus
  ☆36Updated 3 years ago
• Soonad / Formality-Net-Animator
  Animations for Elementary-Affine-Net interactions
  ☆11Updated 5 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• Soonad / Moonad
  An upcoming operating system built on Type-Theory
  ☆43Updated 4 years ago
• VictorTaelin / interaction-calculus-of-constructions
  A minimal proof checker.
  ☆75Updated 7 months ago
• Soonad / FormalityFM
  Formality in itself
  ☆20Updated 4 years ago
• AndrasKovacs / cctt
  high-performance cubical evaluation
  ☆70Updated 4 months ago
• UlfNorell / insane
  Toy typechecker for Insanely Dependent Types
  ☆79Updated 11 years ago
• Innf107 / vega-prototype
  Prototype for https://github.com/Innf107/vega
  ☆19Updated 8 months ago
• Soonad / Formality-Core
  Specification of the Formality proof and programming language
  ☆41Updated 2 years ago
• kindelia-archive / LambdaVM
  A next-gen, massively parallel, beta-optimal functional runtime.
  ☆10Updated 3 years ago
• Soonad / Formality-Haskell
  A Haskell implementation of the Formality language
  ☆18Updated 5 years ago
• johnyob / dromedary
  Dromedary is an experimental subset of OCaml, using constraint-based type inference!
  ☆48Updated 5 months ago
• fgdorais / lean4-parser
  Parser Combinator Library for Lean 4
  ☆47Updated this week
• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆43Updated last month
• VictorTaelin / absal-rs
  ☆35Updated 6 years ago
• art-w / unicorn
  Purely functional GUI algebra
  ☆75Updated last week
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆70Updated 8 years ago
• samueldurantes / haildo
  Toy programming language
  ☆19Updated 10 months ago
• jfecher / algorithm-j
  A minimal implementation of Hindley-Milner's Algorithm J in OCaml
  ☆60Updated 3 years ago