namin / 3-proto-lispLinks
Code from the paper Reflection for the Masses by Charlotte Herzeel, Pascal Costanza, and Theo D'Hondt.
☆14Updated 4 years ago
Alternatives and similar repositories for 3-proto-lisp
Users that are interested in 3-proto-lisp are comparing it to the libraries listed below
Sorting:
- A compiler to IA32 and REPL for maru in maru under 7k s-expressions☆18Updated 5 years ago
- the reflective tower Blond by Olivier Danvy & Karoline Malmkjær☆16Updated 7 months ago
- ☆19Updated 2 years ago
- Interactive Scheme Primer, written in Scheme.☆22Updated 7 months ago
- Prototypes: Object Orientation, Functionally☆49Updated this week
- Kanren with databases☆44Updated last year
- software archaeology of reflective towers of interpreters☆16Updated 7 months ago
- minikanren mips assembler/disassembler☆33Updated 10 years ago
- exploration of reflective architectures in Scheme☆20Updated 3 years ago
- purple: compiling a reflective language☆33Updated last year
- A metalanguage for creating sophisticated DSLs in Racket.☆38Updated 2 months ago
- Normalization-by-evaluation in miniKanren☆25Updated 2 years ago
- A programming argot☆57Updated last year
- Wasm tooling in Racket.☆45Updated 2 years ago
- Library for building Interactive Direct Manipulation Tools (IDMTs) in Racket.☆30Updated 5 years ago
- Datalog implemented in minikanren☆24Updated 8 years ago
- combined object/lambda architcture☆25Updated 16 years ago
- Cur dependently-typed language in miniKanren.☆17Updated 7 years ago
- Easy scripting for DrRacket☆18Updated last month
- ☆22Updated 5 years ago
- experimental computational medium and supporting tools☆23Updated this week
- A virtual machine for the Self language, written entirely in Self, and a development environment for that VM.☆43Updated 16 years ago
- a minimal implementation of incremental computation in Scheme☆36Updated 8 years ago
- nqthm - the original Boyer-Moore theorem prover, from 1992☆56Updated 9 years ago
- A small language to demo turning an interpreter into a compiler☆11Updated 9 years ago
- A tiny programming system inspired by Boxer leveraging the HTML DOM structure. Illustrates naive realism, explicit structure and evaluati…☆24Updated 7 months ago
- A core concatenative programming language with variables and first-rank polymorphic type inference☆31Updated 5 years ago
- Tree-automata-based run-time type constraints for miniKanren☆14Updated 2 years ago
- Python interpreter for Peter Landin's SECD abstract machine.☆42Updated 12 years ago
- Compiler generator (3rd Futamura projection) for first-order Scheme☆13Updated 9 years ago