... The shuffle strings are beginning to look more and more like the earlier list notation in Prolog, where the left part of the above strings would perhaps...
manfred's 'let' extension corresponds to my 'lambda' combinator. i've adopted his notational suggestion and replaced '--' with ':'. i don't entirely agree with...
sa@...
May 3, 2004 5:43 pm
1781
Hello all, I'm new to Joy (I do know Forth). To me, Joy combinators and lambda expressions seem to be semantically the same thing. In [1 2 3] [dup *] map for...
"Tanksley, William D. Jr." <TanksleyJrW@...> wrote on 05/03/2004 02:37:53 PM: [:] ... data ... i would very much like to know whether this is true in...
sa@...
May 3, 2004 7:20 pm
1784
From: sa@... [mailto:sa@...] ... I made at least 3 unsupported claims in that paragraph -- which one would you like to have substantiated? 1. writing...
"Tanksley, William D. Jr." <TanksleyJrW@...> wrote on 05/03/2004 ... data ... 2 imples 3. and i suppose one could argue that over the course of time, the...
sa@...
May 3, 2004 8:04 pm
1786
I've read with interest the recent discussions on shuffle strings and pattern matching as I've been toying with a Joy extension which allows a mix of...
... Sorry, my choice of terminology was confusing. I'm really talking about immutable local variables since each function begins by popping its arguments off...
Some of the recent discussion prompts me to clarify the difference between the (LET-like) generalisation and lambda abstractions. On Mon, 3 May 2004...
Billy, Thanks for the explanation. I realized soon after sending that I'd confused the terms 'combinator' and 'quotation'. In my brief experience with Joy...
... When your head has exploded trying to keep track of what all is on the stack; i.e. when you need highly non-local behavior. Then names become a tremendous...
... I must have misunderstood somewhere, my question related to anonymous functions, when to use lambdas vs. quotations. Is there a connection between that...
... I was saying that a big advantage of lambdas is that they bind their arguments to names (independently of whether they themselves are named or not). It's...
in cK, 'let' is a combinator which uses a pattern to distribute items from the stack into various positions in a quotation. cK versions of your r-ack, r2-ack,...
stevan apter
sa@...
May 9, 2004 9:52 pm
1801
... You don't need to keep track of the position of 10 objects on the stack. Factor your words into smaller pieces, such that each word manipulates at most 3...
Slava Pestov
slava@...
May 9, 2004 11:05 pm
1802
... Is there a universal algebraist on board? I have a vague recollection reading in a book on universal algebra that any algebra with n-ary operators (n > 2)...
... It's not a book on universal algebra per se, but I can recommend "Term Rewriting and All That" by Franz Baader and Tobias Nipkow (Cambridge University...
Joel Kelso
chiral@...
May 11, 2004 12:47 am
1804
On Mon, 10 May 2004 phimvt@... wrote: [..] ... I did find it. P.M. Cohn, 1965, Universal Algebra, Harper & Row. p 147: "Theorem 7.1 Let Omega...
Hi Manfred, ... This has me a bit worried; I think I'm missing something here. Can you please make precise what is meant by "operation on a finite set" and "in...
reading through the documentation for wouter van oortmerssen's 1994 language: http://wouter.fov120.com/false/false.txt programs monadic function of the stack,...
