melsman / aplcompileLinks
APL compiler written in Standard ML
☆36Updated 5 years ago
Alternatives and similar repositories for aplcompile
Users that are interested in aplcompile are comparing it to the libraries listed below
Sorting:
- MLton with Realtime GC and Threading features☆103Updated last year
- OCaml implementation of the K 2.0 array programming language☆81Updated 9 years ago
- The Mythryl programming language☆117Updated 10 years ago
- A small implementation of type inference☆80Updated 10 years ago
- A minimalist type-inferred programming language with procedural macro support☆136Updated 5 years ago
- APL Compiler targeting a typed array intermediate language☆217Updated last year
- An OCaml/Mirage-friendly implementation of the 9P protocol☆67Updated 5 months ago
- Simple Neural Network Examples in 8 lines APL☆32Updated 2 years ago
- Demo of Ken Thompson's Reflections on Trusting Trust as a tiny lisp compiler☆97Updated 10 years ago
- pacc: a compiler-compiler☆37Updated 9 years ago
- Programming language designed as an experiment to explore mutation and aliasing control☆35Updated 5 years ago
- The Wasp Lisp Virtual Machine, Associated Libraries, and MOSREF☆107Updated 7 years ago
- Generate formatted C++ from Racket S-expressions☆36Updated 10 years ago
- minimal lisp that compiles to x86☆10Updated 8 years ago
- Sild is a lisp dialect☆43Updated 2 months ago
- A simple implementation of the SECD abstract machine (https://en.wikipedia.org/wiki/SECD_machine)☆126Updated 12 years ago
- Bindings for llvm in racket☆66Updated 10 years ago
- Racket port of the nanopass-framework☆34Updated 4 years ago
- Scripting with Least Privilege☆110Updated 8 years ago
- The Pascal-F Verifier☆51Updated 8 years ago
- An Interpreter for Extended Relational Algebra (Scheme based)☆84Updated 9 years ago
- A C implementation of the Shen programming language☆70Updated 4 years ago
- Irken is a statically typed variant of Scheme. Or a lisp-like variant of ML.☆214Updated 3 years ago
- ☆52Updated 8 years ago
- Metaprogramming framework for .net☆92Updated 6 years ago
- nqthm - the original Boyer-Moore theorem prover, from 1992☆57Updated 9 years ago
- A virtual machine for Monte.☆68Updated 3 months ago
- a stack-based concatenative virtual machine for implementing highly concurrent languages☆45Updated last year
- adds an optional type system to J language☆21Updated 10 years ago
- A Scheme (R7RS) implementation written in D☆60Updated 7 years ago