3 ms·
It would look like a very (very!) long string of U's. :-) You might enjoy this: http://www.flownet.com/ron/lambda-calculus.html http://www.flownet.com/ron/la
by lisper 12y ago
It would look like a very (very!) long string of U's. :-)
You might enjoy this:
http://www.flownet.com/ron/lambda-calculus.html http://www.flownet.com/ron/lambda-calculus.html
- arethuza 12y agoActually, one of the many things I learned from doing a final year project for my CS degree on "benchmarking" different sets of combinators was how to write a garbage collector - I was doing this in '87/'88 on a Unix mini (HLH Orion) and memory was tight and my trees were comparatively huge!
- tome 12y agoPresumably a tree of U's.
- lisper 12y agoOh, right. Good point. It's worth noting, BTW, in case anyone is still following this thread, that what is going on here in all of these single-instruction languages is not particularly interesting. You're just encoding the program semantics in the arguments, or in the structure of the tree, or the length of the program, or something like that, rather than in the instructions.