om While I'm pleased that my "forthski Vs. Joy" inquiry generated such a healthy discussion, I am disappointed that it doesn't seem that the question was...
1146
Manfred von Thun
phimvt@...
Jul 9, 2002 1:30 am
Dear friends As you know from my last posting, I have been on a long once-in-a-decade holiday. Now I am back at work, and will respond to the concatenative...
1147
Manfred von Thun
phimvt@...
Jul 9, 2002 1:51 am
... [..] The dip combinator dives underneath the top of the stack, does something there and finally restores that under which it dived (dove?). I was initially...
1148
e1_t
Jul 10, 2002 2:06 am
I just finished adding continuations to Meta/4 and I was wondering what other people think of them. I'm also wondering if anyone thought of a different way to...
1149
e1_t
Jul 10, 2002 2:49 pm
... Correction - due to tail call optimization this should be 1 cont (which is the same as exit really). Although cont could be defined as a macro that...
1150
wtanksleyjr@...
wtanksle
Jul 10, 2002 4:27 pm
From: "e1_t" <e1_t@...> ... Continuations are worderful, but what you've implemented is only part of what people can use. See mlg's work on...
1151
e1_t
Jul 11, 2002 12:06 am
... part of what people can use. See mlg's work on continuations, backtracking, and coroutines in Forth to see the power of an open return stack. ... want to...
1152
Billy and Melissa
wtanksle
Jul 11, 2002 4:41 am
Was my formatting that terrible? Ouch. Sorry. I posted from egroups, and they usually do better. Anyhow: From: "e1_t" <e1_t@...> ... When I say...
1153
e1_t
Jul 11, 2002 6:19 am
... multiple ... work: if ... not ... unwinds ... Seems I messed that up. ... onto ... that ... numbers ... takes a ... Meta/4 ... almost ... specific ... is...
1154
wtanksleyjr@...
wtanksle
Jul 11, 2002 3:46 pm
From: "e1_t" <e1_t@...> ... I wish I'd thought of that -- great idea. So you're saying that ";" would be like Forth's "[']"? This wouldn't be as powerful...
1155
e1_t
Jul 12, 2002 12:22 am
... would be like Forth's "[']"? ... Well sort of. Only when it's used from within other code stacks. Normally a word is defined as [ code ] " word" ; If ; is...
1156
e1_t
Jul 13, 2002 5:48 am
Ignore my last post. I wasn't thinking when I wrote that heh - it would work but there are heaps of problems with that approach. I might in the end have to...
1157
Manfred von Thun
phimvt@...
Jul 17, 2002 6:07 am
... I am VERY impressed. This is a huge piece of work. Very professional. Thank you very much. As soon as I can I shall go through it in detail. ... Yes,...
1158
Manfred von Thun
phimvt@...
Jul 17, 2002 6:40 am
I have been reading this discussion with considerable interest, although I could not follow the details properly. Do you have any particular kinds of...
1159
wtanksleyjr@...
wtanksle
Jul 17, 2002 3:03 pm
From: Manfred von Thun <phimvt@...> ... I plan to brag: "Joy, unlike your favorite language, supports continuations!" ;-) ... They're also...
1160
Billy and Melissa
wtanksle
Jul 28, 2002 6:53 pm
From: "e1_t" <e1_t@...> ... This is very limiting as well; the main problem is that it's enormously complex. Why not just define a word which returns the...
1161
e1_t
Jul 29, 2002 12:08 am
... possible ... stack ... enormously ... string as an I don't think it's limiting but like I said in my last post - there are heaps of problems with this...
1162
Manfred von Thun
phimvt@...
Aug 16, 2002 6:34 am
... [Q&A about continuations] ... Yes. I know that this is useful in imperative languages, and (I imagine) behind-the-scenes implementation of functional ...
1163
m_l_g3
Aug 18, 2002 6:48 pm
... The reason to introduce the L stack was: 1. words can call continuation, that is, transfer control forward leaving the address-to-backtrack on the return...
1164
m_l_g3
Aug 18, 2002 7:03 pm
... foo =/= bar foo == [r bar EXIT '] where [r ... '] stand for return stack nesting. Ok, we can have a language with the notation borrowed from mlg's ...
1165
e1_t
Aug 19, 2002 12:16 am
... the ... is ... programmer ... return ... that - ... I don't have your papers or the time right now to remind myself of how it all works and what || does...
1166
Brent Kerby
iepos@...
Aug 21, 2002 12:57 am
The last while I've been doing some reading on reversible computing systems. It's quite a fascinating idea, really; you all might like to look at Mike Frank's...
1167
Brent Kerby
iepos@...
Aug 21, 2002 5:41 pm
After a bit more thinking about this, a few more thoughts surfaced ... First, I probably didn't clearly explain the whole point of the reversibility idea. The...
1168
Manfred von Thun
phimvt@...
Aug 23, 2002 2:12 am
On Wed, 21 Aug 2002, Brent Kerby wrote: [..lots of good stuff about reversible operations in a Joy-like language] Legend has it that in the 20's one of the...
1169
Manfred von Thun
phimvt@...
Aug 26, 2002 4:00 am
On Fri, 23 Aug 2002, Manfred von Thun wrote: [..] ... Here is a reasonable notation to use for the rules and for tracing the forward and reverse execution....
1170
Brent Kerby
iepos@...
Aug 26, 2002 4:11 pm
... The main advantage I see of this "reversal stack" idea is that it allows irreversible programs to become reversible, simply by changing the interpretation...
1171
Asim Jalis
asimjalis@...
Aug 26, 2002 6:21 pm
Is anyone using Joy for real-world applications? If so, what are some of these? Asim...
1172
e1_t
Aug 26, 2002 11:49 pm
... allows ... essence, all ... but instead ... new "zap" ... stack. ... they've always ... this kind ... consuming ... writing a loop ... done using ... The...
1173
e1_t
Aug 27, 2002 12:09 am
... Someone please correct me if I'm wrong but I don't think anyone is using Joy for any serious applications right now. I'm sure many members of this message...
1174
Brent Kerby
iepos@...
Aug 27, 2002 1:25 am
... The way I see it, it doesn't really matter fundamentally whether the garbage is forced to be kept on the main stack, or on a garbage stack (i.e., where ...
