Alternatives and similar repositories for lys

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

• diku-dk / smlfut
  Call Futhark programs from Standard ML
  ☆10Updated 2 weeks ago
• Storyyeller / polysubml-demo
  A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference
  ☆51Updated 3 months ago
• asperti / BOHM1.1
  Bologna Optimal Higher-Order Machine, Version 1.1
  ☆72Updated 8 years ago
• AndrasKovacs / dtt-rtcg
  Demo for dependent types + runtime code generation
  ☆69Updated 3 months ago
• CakeML / pure
  A verified compiler for a lazy functional language
  ☆36Updated 3 weeks ago
• vmchale / kempe
  Kempe is a compiled stack-based language
  ☆58Updated 8 months ago
• vmchale / apple
  Apple array system
  ☆66Updated this week
• bkomuves / nanohs
  a self-hosting lambda calculus compiler
  ☆35Updated 2 months ago
• robertkleffner / wort
  A core concatenative programming language with variables and first-rank polymorphic type inference
  ☆31Updated 5 years ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆59Updated last year
• UberPyro / prowl
  WIP stack language that uses regex for control flow
  ☆42Updated last year
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• diku-dk / sml-http
  HTTP utility library for Standard ML
  ☆11Updated last year
• contificate / match
  Match compilation algorithm in OCaml
  ☆27Updated 3 months ago
• MPLLang / mpllib
  Grab-bag library for the MPL compiler (https://github.com/mpllang/mpl)
  ☆20Updated 3 months ago
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• hazelgrove / diy-hazelnut
  A template for you to implement Hazelnut yourself
  ☆22Updated this week
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• sparverius / ats-acc
  Pretty-print error messages of the ATS Compiler
  ☆35Updated 5 years ago
• jkoppel / ecta
  ☆35Updated last year
• adrieng / melitte
  Toy implementation of Martin-Löf Type Theory
  ☆28Updated 2 years ago
• swtwsk / vinci-lang
  A proof-of-concept compiler targeting SPIR-V for a toy ML functional shading language
  ☆15Updated 3 years ago
• elpinal / bright-ml
  A statically-typed programming language based on "F-ing modules"
  ☆81Updated 4 years ago
• dunhamsteve / newt
  A toy dependent typed language.
  ☆29Updated 2 weeks ago
• ToposInstitute / polytt
  A type theory with native support for Polynomial Functors.
  ☆39Updated last year
• neel-krishnaswami / inverse-bidirectional-typechecking
  A Toy Inverse Bidirectional Typechecker
  ☆31Updated 6 years ago
• LPTK / simpler-sub
  Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…
  ☆26Updated 2 years ago
• soren-n / bidi-higher-rank-poly
  Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…
  ☆22Updated 4 years ago
• RedPRL / asai
  🩺 A library for compiler diagnostics
  ☆46Updated 4 months ago
• zaklogician / typical-antiphrasis
  Paradoxes of type theory, described didactically. With accompanying proofs in Agda.
  ☆39Updated 4 years ago