Alternatives and similar repositories for sandbox

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

• 05st / artemis
  Statically typed, high-level functional programming language.
  ☆17Updated 3 years ago
• chameco / bramble
  dependently-typed lisp with flexible compiler backends
  ☆27Updated 6 years ago
• mmcqd / datatt
  A dependent type theory with user defined data types
  ☆46Updated 3 years ago
• kprotty / lazer
  A programming language focused on concurrency and low memory usage
  ☆12Updated 6 years ago
• facet-lang / facet
  a functional programming language with algebraic effects and handlers
  ☆82Updated 4 months ago
• fwcd / curry-language-server
  IDE support for the functional logic programming language Curry
  ☆31Updated 2 months ago
• e-wrks / edh
  Đ (Edh) - The next-big-things ought to happen with Haskell not C/C++
  ☆28Updated last year
• mmcqd / pure
  A pure type system implemented in OCaml
  ☆78Updated 4 years ago
• siraben / mini-haskell
  A self-hosting mini Haskell compiler with a mini C runtime.
  ☆75Updated 5 years ago
• paulstansifer / unseemly
  Macros have types!
  ☆129Updated 2 years ago
• owo-lang / narc-rs
  (WIP) Dependently-typed programming language with Agda style dependent pattern matching
  ☆80Updated 4 years ago
• mb64 / poly
  A WIP compiler for a functional language. Very incomplete!
  ☆16Updated 3 years ago
• polytypic / f-omega-mu
  Fωμ type checker and compiler
  ☆54Updated 2 years ago
• hydrolarus / cytosol
  A programming language somewhat resembling cellular processes.
  ☆34Updated 3 years ago
• atennapel / tinka-hs
  Dependently typed programming language written in Haskell
  ☆22Updated 3 years ago
• Soonad / Formality-Core
  Specification of the Formality proof and programming language
  ☆41Updated 2 years ago
• Superstar64 / aith
  [Early Stages] Low level functional programming language with linear types, first class inline functions, levity polymorphism and regions…
  ☆62Updated last year
• jfecher / algorithm-j
  A minimal implementation of Hindley-Milner's Algorithm J in OCaml
  ☆68Updated 3 years ago
• mb64 / LC-interpreter
  A compiler and runtime for normalizing the untyped λ-calculus
  ☆31Updated 3 years ago
• brendanzab / rust-nbe-for-mltt
  Normalization by evaluation for Martin-Löf Type Theory with dependent records
  ☆98Updated 3 years ago
• andreypopp / type-systems
  Playing with type systems
  ☆51Updated 6 months ago
• jonsterling / dreamtt
  A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.
  ☆83Updated 3 years ago
• ice1000 / agda-mode
  Accessing Agda's interaction mode via command line & external tactic for Agda.
  ☆26Updated 4 years ago
• LightAndLight / qtt
  Quantitative Type Theory implementation
  ☆54Updated 4 years ago
• namin / higher-rank
  Practical type inference for arbitrary-rank types
  ☆11Updated 6 years ago
• naalit / pika
  A WIP little dependently-typed systems language
  ☆41Updated 11 months ago
• phase / dtt
  dependent type theory experiment
  ☆26Updated last year
• Innf107 / vega-prototype
  Prototype for https://github.com/Innf107/vega
  ☆19Updated 11 months ago
• granule-project / gerty
  A small implementation of graded modal dependent type theory. A younger cousin to Granule.
  ☆60Updated last year
• eayus / sirdi
  Package manager for Idris
  ☆37Updated 2 years ago