... (I assume you mean concatenative (?)) ... arguments) ... inspect the ... How about strongForth ? IIRC every word has to have a statically determinable...
783
md9slj@...
Sep 3, 2001 2:10 pm
Hi. I just wondered why the quoting machanism in joy (used (among other things) for providing aruments to higher-order words, like map) makes it possible to...
784
Manfred von Thun
phimvt@...
Sep 4, 2001 1:48 am
Bill Stoddart asked me to forward the following to "concatenative". I wish I could attend myself. If I had known about it earlier, I would have encouraged...
785
Manfred von Thun
phimvt@...
Sep 4, 2001 2:09 am
1. I have added a library for writing interactive tutorials to the Joy page. It contains some operators for interactive programs which use "get" and need some...
786
rrt@...
Sep 5, 2001 9:18 am
If no-one else is available, I'd be happy to present a paper about Joy, while disclaiming expertise on it (though I think I'd have time to play a bit more to...
787
Jack Waugh
waugh@...
Sep 5, 2001 2:35 pm
I don't know why the designers of Joy want quotations to be divisable by default, but I can answer your last question ... Both. In Joy, the literals 1, 2, 3,...
788
Jack Waugh
waugh@...
Sep 5, 2001 3:11 pm
It hit me that what Manfred von Thun has done with the lambda calculus, we could extend to the first-order logic of quantification and predication (FOLQP)....
789
Billy Tanksley
wtanksley@...
Sep 5, 2001 6:47 pm
From: Jack Waugh [mailto:waugh@...] ... Formally, you can't do that with functions anyhow -- i is defined only for quotations, not functions. -Billy...
790
Manfred von Thun
phimvt@...
Sep 6, 2001 7:11 am
... Hi Reuben, I'm so glad that you are still here with us. I had seen your name on the conference list, of course. Your offer to give a paper is of course...
791
Manfred von Thun
phimvt@...
Sep 6, 2001 7:23 am
... [more details deleted] You are exactly right. In fact, what you are describing is just about the history of Joy in reverse. The elimination of variables of...
792
Manfred von Thun
phimvt@...
Sep 6, 2001 7:29 am
... Yes. One can always say 2 [] cons i of course, which puts the 2 back onto the stack. Hence 2 [] cons i == 2 But the following is true ONLY if what is...
793
Manfred von Thun
phimvt@...
Sep 6, 2001 7:52 am
... The question is dealt with just a little towards the end of the "Rationale for Joy" paper. ... I had not thought about this, but yes, you are right, a...
794
md9slj@...
Sep 6, 2001 9:37 am
... Aha ! ... only for ... Of course. [ blah ] puts a quotation on the stack and i interprets the *quotation* as a program fragment. ... Yes. I hadn't thought...
795
(no author)
Sep 7, 2001 8:52 am
... I don't have much time for writing at the moment (I still have to write my own paper), so if you could help with that, that would be excellent. I was...
796
Manfred von Thun
phimvt@...
Sep 10, 2001 4:46 am
... All of the above holds for all literals, so instead of 2 you could have 1) a truth value: true false 2) a character: 'A 'x '! 3) a set: {2 6 31} {4}...
797
Manfred von Thun
phimvt@...
Sep 10, 2001 4:49 am
... The conference prospectus asks for 8 pages. My initial draft would be: Pages Content From 1 Introduction (Joy synopsis) + Forth...
798
Manfred von Thun
phimvt@...
Sep 11, 2001 9:05 am
Our University is in the process of installing a new machine for our web pages, and new URLs (!). In the process of moving my pages all sorts of horrible...
799
(no author)
Sep 11, 2001 10:29 am
At Mon, 10 Sep 2001 14:44:51 +1100, ... Sounds excellent....
800
Manfred von Thun
phimvt@...
Sep 17, 2001 11:11 am
I'm sorry it took so long to look at your contribution. It deserves more comments than I have written, but this is all I can do at the moment. - Manfred ... ...
801
Billy Tanksley
wtanksley@...
Sep 17, 2001 7:25 pm
From: Manfred von Thun [mailto:phimvt@...] ... The existing technology is pretty simple: brute force 2^n search. Well, at least at worst...
802
S. Alexander Jacobson
shop2it@...
Sep 18, 2001 12:53 am
Isn't strong typing and type-inference a big problem because recursion in Joy relies on the K-combinator which can't be typed in Hindsley-Milner type systems? ...
803
md9slj@...
Sep 18, 2001 3:30 am
... Ok, no prob. ... a ... [snip] ... the ... the ... off / ... every ... place ... Ok, I'll go for arity system. The important bit was that it checks the...
804
md9slj@...
Sep 18, 2001 4:03 am
... Well, at ... Do you mean the complexity of type inferencing ? (I think I read that, at least in ML, one rarely in practice come anyway near the worst case....
805
md9slj@...
Sep 18, 2001 6:14 am
... recursion in ... Hindsley-Milner ... Are you sure that recursion in Joy depends on a K-combinator ? Shouldn't it be an Y-combinator or something similar ? ...
806
Billy Tanksley
wtanksley@...
Sep 18, 2001 6:28 pm
From: md9slj@... [mailto:md9slj@...] ... Ah. My understanding was that brute force wasn't a problem because all of the languages...
807
Manfred von Thun
phimvt@...
Sep 19, 2001 6:54 am
... I wish I could elaborate. My remark was prompted by a discussion on the group a short while ago, where I wrote a few unconsidered remarks. That caused me...
808
Jack Waugh
waugh@...
Sep 19, 2001 9:39 pm
In re: ". . . implementing lazy (perhaps infinite) lists in Joy. I'm not sure whether it would really need some counterpart of set! in Scheme. Maybe it can...
809
Ocie Mitchell
ocie_mitchell@...
Sep 23, 2001 11:36 pm
Sorry to post such an elementary question, but I want to start using the language as soon as possible. I grabbed the latest tarfile of the Joy sources and was...
810
John Cowan
cowan@...
Sep 24, 2001 1:40 am
... Definitions are only recognized between LIBRA (for which DEFINE is a synonym) and a period, thus: LIBRA foo == dup *; bar == dup +. Individual definitions...
811
Manfred von Thun
phimvt@...
Sep 24, 2001 5:52 am
... There is no need to apologise, this one of the reasons for the mailing group. ... Thanks for the clarification, John. ... You are right. The only place...
