Joy in Java (JoyJ), an interpreter for Joy implemented in Java, is now available for download from http://appforge.apc.edu.ph/frs/?group_id=114&release_id=221 ...
... Congratulations! I'm especially impressed that the implementation language is NetRexx, a language I particularly like. I've had a soft spot for Rexx ever...
http://home.vrweb.de/stephan.becher/forth/ StrongForth -- the language that adds strong polymorphic static typechecking to Forth -- is back online, with a new...
Hi, John, ... [snipped] ... language ... Thank you. ... the OS/2 EE ... loaded ... I also encountered Rexx on OS/2 and earlier on the AS/400. One reason I...
Congratulations, Ray, this looks very impressive. Your choice of an implementation language really did pay off, just judging by the size of the entire...
... Java (and therefore Netrexx) programs can exit by calling System.exit(n) with the exit code. ... I'd be happy to comment further, but I don't know what on....
Lately I've been wondering if anyone has given thought to what concatenative logic programming would look like. Prolog programs seem deeply intertwined with...
... [..] One of (possibly many) answers is along these lines: In logic programming we generally, though by no means always, want answers in the form X = ... Y...
... Thank you. ... I would call this a case of serendipity--I chose NetRexx because, of all the languages that run in the JVM, it is the one I am most ...
... [..] ... Many years ago I came across a language in which ³everything was a string², with a severe performance penalty. I cannot remember what it was,...
... I now think that my response was overly pessimistic, and that concatenative notation could be used for such a language call it Joylog. ... The basic...
... Only that, in a vague sense, allegories are to categories as relations are to functions. Not to dismiss allegories: they ought to map nicely onto...
... <delurk> Sounds like Tcl, which is a fine glue/embedded language, but not the kind of thing I personally would be comfortable using for anything other than...
... Most likely a version of TCL prior to 8.0. In TCL even blocks of code are strings; the conditional is actually "if <expr> <string> else <string>", and {...
... It was when I was ³in my computational nappies² (now here is something immensely quotable!), in the late 70¹s. A friend of mine thinks it was probably a...
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...
