 Recently, I've been taken by this project of @wryl that might be of interest to folks diving into minimal virtual machines. It's a string rewriting scheme with a single operator <>, similar to Thue, with the added capability of binding addresses in the input string to registers and manipulate them during the transcription. It's an extremely elegant runtime, capable of emulating lisps, type systems, concatenative languages, all without any form of garage collection. 25 comments
 @kr1sp1n @neauoire The C implementation should be able to be invoked by running.. ./bin/modal lisp.modal .. from the top level directory after running `make`. The old `define` syntax is replaced with `<>` in the C implementation. You can add.. `define <> define` .. to the top of any Modal source file to run it with the Python implementation. Bear in mind, I/O won't work in the Python implementation. @neauoire @wryl I guess you're aware of XL, the language behind https://tao3d.sourceforge.net/ If so, could you comment on the differences for those that, like me, aren't familiar with rewriting languages?  @neauoire @wryl Bug report for the ANSI C implementation: $ cat x.modal .. (1 2 3) (4 5 6) swap pop dup $ gcc -g modal.c -o modal && ./modal x.modal 02 .. (4 5 6) dup 00 .. (4 5 6) <> (?x dup) (?x ?x) @akkartik @wryl Let us know what you find while exploring Modal, we're still figuring stuff out, what's possible and whatnot. I haven't documented the explode register(?*), but it's going to be really useful to do arithmetic. <> (explode ?*) (str (?*)) .. (explode hello) |
Gregory's Server
@neauoire @wryl reminds heavily of Markov algorithms I learned at uni. It was fun coming up with the rewriting rules! And more rewarding than those Turing machines 😤