I wanted to announce that I am developing a new open-source concatenative programming language called Unimperative. It is still in its early stages, but if you...
... Very interesting. Good luck! Interestingly, some mathematicians use concatenative RPN to denote function composition. The opening chapters of their books...
I am trying to decide how to arrange the operators in Unimperative. Currently I have ">>" meaning right-concatenation. E.g. f >> g == g . f; And the "<<" means...
... It's hard to judge unless you explain what "f . g" means. Originally it meant \x.f(g(x)), but now it often means \x.g(f(x)) instead, and far too many ...
Sorry I wasn't clear. I meant f . g to mean the composition operator, i.e. f(g); Another option is that instead of g >> f and f << g I could use f(g) and g, f...
i can't see the point of supporting, much less mixing, both left and right directionality. as i pointed out in my messages on artima, we read code left- ...
sa@...
Feb 14, 2006 7:14 pm
2774
I agree with you. So only one way: "," which reads left to right, like Joy. Thanks for debating it with me! ... [Non-text portions of this message have been...
Hello all, Here is a brief question about Joy. In Joy the combinator "ifte" takes three quotations, but why not instead a boolean value and two quotations? I...
Hi Chris, Your question has come up before on the group, and several people come up with the same opinion as you. First, there is in fact an operator...
Hi Manfred, Thanks for your prompt and informative response. Christopher http://www.unimperative.com [Non-text portions of this message have been removed]...
... There's a third choice: the user has to arrange the computation so that the values needed to compute the booleans are not needed after the boolean has been...
As some of you know, I've been working for a long time on a replacement interpreter for Joy in Chicken Scheme. I chose Chicken because its compiler generates...
use the extension, conform to the spec. ... maintain...
sa@...
Mar 23, 2006 8:31 pm
2783
... Alas, it's not so simple. The Joy papers explicitly say that the maximum size of a set is implementation-dependent, so 31-bit sets are in fact conformant....
... Urk. Not to mention that giving MORE bits would make programs written for Chicken-Joy not compatible with C-Joy. I'm in favor of unlimited bits, though,...
These are difficult questions. I seem to remember about 20 years ago there was a lot of discussion about the advantages of tagged architectures, in which ever...
... Of course, that would be tough in the Unicode world, with a theoretical maximum of 17 * 2^16 = 1,114,112 characters! ... Last night it occurred to me that...
... is ... the ... The problem isn't with "cons", it's with "uncons" and friends. The Joy language doesn't distinguish between lists and functions, which is ...
Can someone (probably Manfred) explain to me how modules and hiding work in Joy0/Joy1? That was a part of the source I didn't need to figure out in revising...
... First, some general comments. The symbol table and its associated functions could be implemented in several ways. The choice would depend much on what the...
... Ah, this was what I didn't grasp before: the symbols *include* their names, rather than being pointed to by their names. In fact, the symbol "bar" as used...
I have written comments about the implementation of HIDE and MODULEs close to the functions inside main.c. I wrote them using the vi editor using the terminal...
... Unfortunately, Yahoo Groups stripped the attachment, even though it is a plain-text one. If you email it directly to me, I can resend to the group without...
Manfred sent these to me by private mail. Here they are: /* file: main.c-COMMENTS */ I comment on the functions in main.c which are relevant to the symbol...
an expression in the combinators S, K, I: Ix -> x Kxy -> x Sxyz -> xz(yz) can be optimized (shortened) by systematically replacing certain patterns with the...
stevan apter
sa@...
Apr 22, 2006 12:54 pm
2795
... This is just from memory: Turner introduced some variants of the classical combinators by others which do what in concatenative terminology might be...
Sorry for the OTness but I know there are some very clever folk on this list who may also be involved in NP stuff and tackling them with domain specific...
