diku-dk / lysLinks
Library for writing interactive and visual Futhark programs
☆22Updated 2 weeks ago
Alternatives and similar repositories for lys
Users that are interested in lys are comparing it to the libraries listed below
Sorting:
- Kempe is a compiled stack-based language☆58Updated last year
- Apple array system☆68Updated 2 weeks ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆77Updated 8 years ago
- a functional programming language with algebraic effects and handlers☆82Updated 8 months ago
- ☆37Updated last year
- An extended typed Lambda Calculus☆21Updated last year
- a self-hosting lambda calculus compiler☆37Updated 6 months ago
- [Early Stages] Low level functional programming language with linear types, first class inline functions, levity polymorphism and regions…☆69Updated last year
- A verified compiler for a lazy functional language☆37Updated last week
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated last week
- source code for the bondi programming language☆41Updated 6 years ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆61Updated 2 weeks ago
- Pretty-print error messages of the ATS Compiler☆37Updated 6 years ago
- Linear algebra package for Futhark☆17Updated 2 weeks ago
- Call Futhark programs from Standard ML☆10Updated 2 months ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆61Updated last year
- Turnstyle is a graphical esoteric programming language based on lambda calculus☆81Updated 2 weeks ago
- A bidirectional type checker☆64Updated 8 years ago
- Match compilation algorithm in OCaml☆30Updated 7 months ago
- The Makam Metalanguage☆199Updated 2 years ago
- The Brown Benchmark for Table Types (B2T2)☆64Updated 2 months ago
- A toy dependent typed language.☆32Updated last week
- Pure functional programming with whole-program mutability inference☆77Updated 2 months ago
- Demo for dependent types + runtime code generation☆72Updated 8 months ago
- A minimal ML, type-inferred, compiled, and/or interpreted in less than 750 lines☆36Updated 5 years ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆27Updated 3 years ago
- A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.☆30Updated 8 years ago
- A SKI combinators interpreter written in assembly☆19Updated 5 years ago
- Lua backend for Idris 2☆28Updated 3 years ago
- Đ (Edh) - The next-big-things ought to happen with Haskell not C/C++☆28Updated last year