melsman / apltailLinks
APL Compiler targeting a typed array intermediate language
☆215Updated 10 months ago
Alternatives and similar repositories for apltail
Users that are interested in apltail are comparing it to the libraries listed below
Sorting:
- Dependently-typed language with Iverson-style implicit lifting☆123Updated 5 years ago
- MLton with Realtime GC and Threading features☆103Updated last year
- OCaml implementation of the K 2.0 array programming language☆81Updated 9 years ago
- Library and Toolkit for Standard ML☆145Updated 2 years ago
- The NIAL language environment☆112Updated 2 years ago
- A small compiler for PCF☆124Updated 4 years ago
- APL compiler written in Standard ML☆35Updated 4 years ago
- A small implementation of type inference☆78Updated 10 years ago
- A wiki and web-services based development environment for Awelon project☆92Updated 6 years ago
- stalin brutally optimizing Scheme compiler, with Debianization patches☆393Updated 4 years ago
- An interpreter for a J-inspired language☆92Updated 2 years ago
- deleted. i recommend using k instead: https://codeberg.org/ngn/k☆235Updated 3 years ago
- a minimal vector programming language☆181Updated 4 years ago
- nanopass compiler framework for Racket☆190Updated last year
- k crash course☆198Updated 2 years ago
- A formalization of category theory in the Coq proof assistant.☆97Updated 8 months ago
- Demo of Ken Thompson's Reflections on Trusting Trust as a tiny lisp compiler☆96Updated 10 years ago
- A tiny *optimising* compiler for an imperative programming language written in haskell☆157Updated 5 years ago
- The Om programming language.☆173Updated 8 months ago
- The Pascal-F Verifier☆49Updated 7 years ago
- Irken is a statically typed variant of Scheme. Or a lisp-like variant of ML.☆212Updated 2 years ago
- nqthm - the original Boyer-Moore theorem prover, from 1992☆54Updated 8 years ago
- A minimalist type-inferred programming language with procedural macro support☆136Updated 4 years ago
- A Haskell implementation of the Shen programming language.☆170Updated 7 years ago
- A simple implementation of the SECD abstract machine (https://en.wikipedia.org/wiki/SECD_machine)☆122Updated 12 years ago
- multi-stage relational programming for staged relational interpreters: running with holes, faster☆134Updated 3 weeks ago
- Nanopass for OCaml☆146Updated 7 years ago
- Algorithmic Information Theory, using Binary Lambda Calculus☆161Updated this week
- An in-memory datalog implementation for OCaml.☆270Updated 8 months ago
- Interpreter for a simple Lisp. Written in Prolog.☆148Updated 2 years ago