... Please do. I disturbs my repose that [blah blah blah] is remarkably infixish. Homework for today. Develop a quotation operator that fits completely neatly...
From: "John Carter" <john.carter@...> ... Always has for me. I've never cared for it. ... Quotations are actually literals, like numbers and strings....
Up to now, I have been rather reluctant to accept recursion via combinator as anything but an academic curiosity. But the idea of GOA's (God's Own Algorithm's)...
... Yes, this is a fascinating. At first it seems sort of like a hack, but I think maybe it has some significance. It be noted here, though, that "'dipi" and ...
After a bit of thought, I realized (to my surprise, actually) that there is a base containing only true combinators, with the property that all combinators can...
... [...] ... OK, I'll do that. Thanks. - Manfred...
Manfred von Thun
phimvt@...
Apr 3, 2002 4:29 am
1053
Sorry, this is a test of whether I can make Yahoo filter out HTML messages. If there's any bold text or a horrible ad, it didn't work. -Billy [Non-text...
... This should be bury5 == reverse6 reverse5 (as it was defined earlier, and as it makes most sense to define it, bury5 buries an item under 5 items; thus...
... Yes, a similar request was made a long time ago, I think. ... Done. See the Joy web page. ... I removed those lines, too, as you suggested. But since I am...
Manfred von Thun
phimvt@...
Apr 3, 2002 6:53 am
1056
... This should be bury5 == reverse6 reverse5 (as it was defined earlier, and as it makes most sense to define it, bury5 buries an item under 5 items; thus...
... This should be bury5 == reverse6 reverse5 (as it was defined earlier, and as it makes most sense to define it, bury5 buries an item under 5 items; thus...
... This should be bury5 == reverse6 reverse5 (as it was defined earlier, and as it makes most sense to define it, bury5 buries an item under 5 items; thus...
... This should be bury5 == reverse6 reverse5 (as it was defined earlier, and as it makes most sense to define it, bury5 buries an item under 5 items; thus...
On Fri, 29 Mar 2002, e1_t wrote: [...] ... Yes, the old pair operator has become pairlist, but I cannot remember when I made that change. The reason was of...
Manfred von Thun
phimvt@...
Apr 3, 2002 7:16 am
1061
On the question of a small base of stack editing (pop,swap....) operators, here is a small contribution: The philosopher/logician W.V.O. Quine addressed a...
Manfred von Thun
phimvt@...
Apr 3, 2002 8:43 am
1062
... The idea was to capture the most common recursion patterns in a few combinators. It works well for linear and binary recursion, and for folding (and hence...
Manfred von Thun
phimvt@...
Apr 3, 2002 9:44 am
1063
... True, GOA's would not necessarily be unique. One could have a mini-pantheon of GOA's, but the length of the GOA's would be unique for any program. ... Last...
I felt it necessary to hunt for the original sources again... I have to correct some detail, and I can add some others to my post. ... [Reprinted in The Ways...
Manfred von Thun
phimvt@...
Apr 4, 2002 5:37 am
1065
... It's interesting that this problem is said to be impossible to solve, whereas my brute-force searcher is an apparent solution. Of course, the theorem is...
... It's interesting that this problem is said to be impossible to solve, whereas my brute-force searcher is an apparent solution. Of course, the theorem is...
... Hmm, my opinion I guess is that such a read-access extension is unneccessary because if you wanted read-access, just use "sip" instead of "dip": [B] [A]...
... Hmm, my opinion I guess is that such a read-access extension is unneccessary because if you wanted read-access, just use "sip" instead of "dip": [B] [A]...
... Hmm, my opinion I guess is that such a read-access extension is unneccessary because if you wanted read-access, just use "sip" instead of "dip": [B] [A]...
I'm not sure what's causing them ... probably something to do with this weird web interface of my email client. By the way, does anybody know what happened to...
... I've written a number of Joy-esque interpreters in a couple of different languages and one of the implementation idioms I keep coming back to is a three...
... I wanted to mention an extension of lambdas which allows something similar to your "move" and "umove" ... (I think I may have mentioned an idea similar to ...
Yep, there is a complete two-combinator Joy base, namely {z, k} where [D] [C] [B] [A] z == [[D] C] A [D] B [B] [A] k == A I don't plan to permanently reserve...
... that for which ... are the ... of ... instructions. ... fast. ... I don't completely follow. What does that have to do with the fact that compilers compile...
... Yes. There's no problem: command line interpretation is being done in the kernel, so the only thing Joy has to do is ignore lines beginning with "#"....
From: "e1_t" <e1_t@...> ... That's mostly true, but actually all code is tuned in some way for the type of machine the author expects it to be running...