woodrush

Amazing, thank you! The PDF [1] containing the Lambda calculus term manages to hang/glitch/crash both Firefox's and macOS Preview's PDF renderer, which in itself is quite the achievement in portability. Update: Nevermind, Firefox handles it perfectly, it just (probably wisely) disables seamless scrolling and I have to use the "next/previous" page buttons manually. macOS got there after a minute or two of loading with no UI indications. [1] https://woodrush.github.io/lambda-8cc.pdf

Almost forgot - Lisp In Life. Pretty sure I first saw it here at HN. IMO the most amazing part is the Life-based processor - once you have that, the rest is "merely" a matter of adding layers. But it's one thing to know someone could do it, quite another to see it in action. https://github.com/woodrush/lisp-in-life Run it in your browser here. Definitely worth zooming all the way in to get a sense of scale. https://woodrush.github.io/lisp-in-life/

Going by example code[1] and the blog post from the author of the examples[2], both. It makes everything harder, but that does stimulate creativity. [1]https://github.com/woodrush/sectorlisp-examples/tree/main?tab=readme-o… [2]https://woodrush.github.io/blog/posts/2022-01-12-sectorlisp-io.html

You can run a friggin full 32 bit lisp on the untyped lambda calculus! https://woodrush.github.io/blog/lambdalisp.html

https://github.com/jdomingu/GameOfLifeLisp/blob/master/game-of-life.ls… + https://woodrush.github.io/blog/posts/2022-01-12-lisp-in-life.html = https://laughingsquid.com/wp-content/uploads/jacob-appelbaum-donald-kn…

Some rather full featured LISP interpreter has already been implemented in 163654 bits (under 20KB) of binary lambda calculus [1] (previous HN discussion at [2]). Wouldn't it be far simpler to implement binary lambda calculus in Malbolge and obtain a LISP interpreter running on Malbolge that way? [1] https://woodrush.github.io/blog/lambdalisp.html [2] https://news.ycombinator.com/item?id=32879848

Page 32 of the pdf...omg the legends were true! https://woodrush.github.io/lambdalisp.pdf

So, "0"-line Hamiltonian story with lead-off in Leeds UK as leed-in to LC_local references without getting to far down the proverbial (alice and wonerland/Matrix) hole? What was the initial bill starting with? Was duck type on the list?[4] Merkel the details with fibonacci sequences (think coding golf[1] meets snarfle the garthnok[2]). !A pretty basic logic circuit ("0"), but boolean in OCT 31 bit more detailed[0] (ok, at time of writing, not DEC 25 yet). Easy to get the picturee if use L-System sequences, but may be a bit to many subtle pointed references to start the reader off with. Does wiki/google 'still have lighting/igniting/firing up the imagination' connotations in today's led illuminated world? (or have to block it out with sectorlisp[5] and decent color type scheme[6] ----- virtual pcb traces/leads: diy customized circuit board making : https://www.instructables.com/Making-A-Customized-Circuit-Board-Made-E… why are you still making pcbs? : https://hackaday.com/2015/09/21/why-are-you-still-making-pcbs/ ! "one-off-diy-pcb-creation-technique" : https://electronics.stackexchange.com/questions/7003/best-one-off-diy-… ----- [0] : No UTF-8/16/32 re-release yet! -> Star Wars Asciimation : https://www.asciimation.co.nz/ Less DMCA notice potential if skip the SNL Jim Carrey characters. [1] ; Code golf : https://en.wikipedia.org/wiki/Code_golf / https://esolangs.org/wiki/Main_Page [2] : 'snarfle the garthnok' :…

It's because I'm an insomniac. When normies are sleeping, I'm running around setting up franchises. One of my other sock puppet accounts that got banned by Lobsters is Paul Kulchenko, who isn't actually the genius who built ZeroBrane Studio https://studio.zerobrane.com/, but is just me pretending to be a Windows developer when I can't fall asleep. Lobsters also banned Hikaru Ikuta (woodrush), who isn't actually a PhD at the University of Tokyo who discovered the lambda calculus expression for LISP https://woodrush.github.io/blog/lambdalisp.html, he's clearly just another one of my sockpuppet accounts I created due to being an insomniac. Those are the sorts of stories we've been sharing with the Lobsters community, and we'd been received very positively until now. I'm disheartened by how the recent unexpected actions of this rogue moderator will impact the wonderful community that had been nothing but kind to us.

The basic tools required for implementing a LC interpreter in LC is demonstrated in LambdaLisp. Although LambdaLisp implements Lisp, the same tools can be used to implement a LC interpreter in LC. The largest concern in question here may be how I/O is done. I/O can be done by viewing a lambda term as a function that takes a string as an input and outputs a string. Here, a "string" can be expressed as a "list" of "characters", where lists can be encoded using the Scott encoding, and characters can be encoded as a list of bits, and "bits" can be encoded as 0=\x.\y.x, 1=\x.\y.y. This I/O strategy is used in LambdaLisp as well, and is explained in my post in [1]. How Lisp terms are encoded as lambda terms in LambaLisp is explained in [2]. To implement a LC interpreter instead of a Lisp interpreter in LC, it then remains to somehow encode and quote a lambda calculus term into a lambda calculus term. The function described by tromp's reply in this thread, called the Universal Machine, does this - it does so by using an encoding called the binary lambda calculus (BLC) notation for encoding lambda terms into lambda terms. In this notation, an arbitrary lambda term in the usual plaintext notation such as \x.\y.\z.(x y z) can be encoded into a bitstream. The converse is also always possible. The Universal Machine uses the BLC notation for expressing lambda terms, with the same 0/1 bit encoding and list encoding mentioned earlier, and outputs a bitstream (encoded as lambda terms)…