diku-dk / lysLinks
Library for writing interactive and visual Futhark programs
☆22Updated last year
Alternatives and similar repositories for lys
Users that are interested in lys are comparing it to the libraries listed below
Sorting:
- Apple array system☆66Updated last week
- Đ (Edh) - The next-big-things ought to happen with Haskell not C/C++☆28Updated last year
- Call Futhark programs from Standard ML☆10Updated last month
- Kempe is a compiled stack-based language☆58Updated 8 months ago
- a self-hosting lambda calculus compiler☆35Updated 2 months ago
- ☆35Updated last year
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆59Updated last year
- Demo for dependent types + runtime code generation☆69Updated 4 months ago
- Pretty-print error messages of the ATS Compiler☆35Updated 6 years ago
- Bologna Optimal Higher-Order Machine, Version 1.1☆72Updated 8 years ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- Changes and Pinafore projects. Pull requests not accepted.☆33Updated 3 weeks ago
- A pure type system implemented in OCaml☆78Updated 4 years ago
- An extended typed Lambda Calculus☆21Updated 10 months ago
- A core concatenative programming language with variables and first-rank polymorphic type inference☆31Updated 5 years ago
- Grab-bag library for the MPL compiler (https://github.com/mpllang/mpl)☆20Updated 4 months ago
- A dependent type theory with user defined data types☆46Updated 3 years ago
- WIP stack language that uses regex for control flow☆42Updated last year
- a functional programming language with algebraic effects and handlers☆82Updated 4 months ago
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆26Updated 3 years ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆53Updated 4 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Talk: "Can Tensor Programming Be Liberated from the Fortran Data Paradigm?"☆64Updated 3 years ago
- A verified compiler for a lazy functional language☆36Updated this week
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- MetaML and MetaOCaml bibliography☆92Updated 6 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A basic type system on top of Prolog, along with higher-order clauses. Translates to normal Prolog.☆29Updated 7 years ago
- CNN in APL☆22Updated 2 years ago
- An embeddable BQN virtual machine in rust. Stay tuned!☆34Updated 3 years ago