4y8 / ski-in-asm
A SKI combinators interpreter written in assembly
☆17Updated 4 years ago
Alternatives and similar repositories for ski-in-asm:
Users that are interested in ski-in-asm are comparing it to the libraries listed below
- A simple λProlog interpreter☆20Updated 3 years ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆14Updated 11 months ago
- a self-hosting lambda calculus compiler☆34Updated 3 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- ☆16Updated 9 months ago
- A bare-bones LCF-style proof assistant☆21Updated 5 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 3 months ago
- File format and optimizer for programs encoded in binary lambda calculus☆11Updated last year
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 8 years ago
- Relational interpreter for miniKanren, in miniKanren.☆14Updated 3 years ago
- Type systems written in 1ML☆9Updated 5 years ago
- ☆24Updated 3 years ago
- Pure relational SKI combinator calculus interpreter.☆10Updated 7 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- Extremely composable embeddable programming language☆21Updated this week
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- A compiler and runtime for normalizing the untyped λ-calculus☆31Updated 3 years ago
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆56Updated 8 months ago
- koneko - a concatenative not-quite-lisp for kittens☆23Updated 5 months ago
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Yoneda lemma in every known language☆17Updated last year
- Implementation of Quantitative Type Theory (in TypeScript)☆12Updated 4 years ago
- An experimental implementation of a tiny ML-like language using an embedded custom expander (WIP, currently just System F core language)☆21Updated 5 years ago
- ☆21Updated 4 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Updated 11 years ago
- A type system for ML-style modules, solving the avoidance problem by focusing [Crary 2020]☆10Updated 4 years ago
- An implementation of Colin James' "Compiling Lambda Calculus"☆16Updated 2 years ago