4y8 / ski-in-asm
A SKI combinators interpreter written in assembly
☆20Updated 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
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆10Updated 11 months ago
- A simple λProlog interpreter☆20Updated 3 years ago
- Velo is a tiny language (STLC + Hutton's Razor with Bools) to showcase & explore efficient verified implementations in Idris2.☆16Updated 2 years ago
- a self-hosting lambda calculus compiler☆35Updated 2 weeks ago
- A Krivine machine for the call-by-name reduction of lambda calculus (+ call/cc) expressions in Haskell.☆13Updated last year
- Pure relational SKI combinator calculus interpreter.☆11Updated 7 years ago
- ☆17Updated last year
- Toy implementation of Martin-Löf Type Theory☆28Updated 2 years ago
- dependently-typed lisp with flexible compiler backends☆27Updated 5 years ago
- Implementation of Martin-Löf Type Theory in Haskell☆16Updated 9 years ago
- Like the Programming Languages Zoo but with esoteric languages.☆25Updated 4 years ago
- An interpreter for the concatenative language Joy, written in Haskell using extensible-effects☆35Updated 5 months ago
- ☆12Updated last year
- An implementation of Colin James' "Compiling Lambda Calculus"☆16Updated 2 years ago
- A small NuPRL style proof assistant☆31Updated 6 years ago
- an encoding of affine effect handlers using pthreads☆14Updated 2 years ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- A formalization of System Fω in Agda☆17Updated 2 months ago
- Rules for writing academic papers and checking them using LTex-ls and LanguageTool☆19Updated 2 months ago
- A WIP compiler for a functional language. Very incomplete!☆16Updated 3 years ago
- Miranda is a pure, non-strict, polymorphic, higher order functional programming language designed by David Turner in 1983-6. https://code…☆57Updated 11 months ago
- An implementation of interaction nets as a forth-like language.☆29Updated this week
- ☆22Updated 5 years ago
- A Dependently Typed Esolang☆10Updated 7 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- ☆24Updated 3 years ago
- An implementation of "A Pretty Expressive Printer" in Racket☆27Updated last year
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Hanoi tower in Coq☆25Updated 4 months ago
- Yoneda lemma in every known language☆17Updated 2 years ago