I've only toyed a little with Forth and just found out about Joy, but anyway .. (On the other hand I know some things about type systems :) ... I would write...
540
Billy Tanksley
wtanksley@...
Mar 5, 2001 10:17 pm
From: ndg-51@... [mailto:ndg-51@...] ... Did you check out the type system in strongForth (available from our Files page, or from...
541
Manfred von Thun
phimvt@...
Mar 8, 2001 1:46 am
... I think it will need a lost of discussion whether concatenative notation (Forth, Joy) is really the best to use for types. Also, distinguish concatenative...
542
Billy Tanksley
wtanksley@...
Mar 8, 2001 2:07 am
It's good to see a post here :-). From: Manfred von Thun [mailto:phimvt@...] ... I wouldn't call any notation using infix "==" concatenative...
543
Manfred von Thun
phimvt@...
Mar 8, 2001 7:22 am
... If one thing is defined to be another, then the two are really one, they are the same thing. For expressions this means that the one can be substituted for...
544
Reuben Thomas
rrt@...
Mar 8, 2001 8:52 am
... Do you have a reference for this? -- http://sc3d.org/rrt/ | violence, n. bravery for cowards...
545
Billy Tanksley
wtanksley@...
Mar 8, 2001 7:14 pm
From: Reuben Thomas [mailto:rrt@...] ... http://home.t-online.de/home/s.becher/forth/ Good stuff. -Billy...
546
Manfred von Thun
phimvt@...
Mar 20, 2001 6:32 am
On Wed, 14 Feb 2001 ndg-51@... wrote: (sorry thatit took so long to reply - MvT) ... Yes, this looks promising. ... I meant, of course: S1 -> S2...
547
cowan@...
Mar 26, 2001 4:53 am
Very interesting stuff, Joy! In the process of setting up Joy on my system, I have made a few small patches to the source, which I now share. 1) In line 40 of...
548
John Cowan
cowan@...
Mar 26, 2001 1:15 pm
This one makes the tailrec combinator properly tail recursive. As currently implemented, it eats the C stack on every recursion to no purpose. At lines 1358...
549
Manfred von Thun
phimvt@...
Mar 29, 2001 8:47 am
On Mon, 26 Mar 2001, John Cowan wrote: [two patch posts] I have looked at your two posts. You have gone throught the Joy sources with great care, thank you....
550
Dirk-Ulrich Heise
hei@...
Mar 29, 2001 9:22 am
... Von: "Manfred von Thun" <phimvt@...> An: <concatenative@yahoogroups.com> Gesendet: Donnerstag, 29. März 2001 09:46 Betreff: Re: [stack]...
551
Dirk-Ulrich Heise
hei@...
Mar 29, 2001 9:27 am
An afterthought, more mathematically inspired: When hitting an unknown variable in a mathematical expression, like in 5 + x = 0 we first assume it to be...
552
John Cowan
cowan@...
Mar 29, 2001 12:50 pm
... I will have some more safety-related patches soon. For example, "cons" does not currently check, when its top argument is a string, that the bottom...
553
John Cowan
cowan@...
Mar 29, 2001 2:32 pm
... That is indeed the effect of my patch. You can define "foo" thus: DEFINE foo == bar dup +. even though "bar" is not known. Likewise, you can create...
554
Martin Young
martin.young@...
Mar 29, 2001 3:59 pm
... So you're going to allow new words to be defined during program execution? By allowing words to be defined at runtime you have to define some semantics ...
555
Soren Renner
srenner@...
Mar 29, 2001 4:04 pm
... Oberon does not have enumeration types. I don't know if the reason had anything to do with type extensions. The first Oberon did't even have a FOR...
556
John Cowan
cowan@...
Mar 29, 2001 5:19 pm
... No, although this capability is already present in Joy thanks to the "include" word. What is being discussed is 1) whether an unbound word should be ...
557
Martin Young
martin.young@...
Mar 29, 2001 5:58 pm
... "include" ... Hmm. I wouldn't have included "include" in "the language" myself. It's more of an environment thing. ... So all you're discussing is...
558
Billy Tanksley
wtanksley@...
Mar 29, 2001 10:37 pm
From: Manfred von Thun [mailto:phimvt@...] ... I find this shocking :-). I'm VERY glad I found Joy; it's good to see some different thought...
559
Billy Tanksley
wtanksley@...
Mar 29, 2001 10:58 pm
From: John Cowan [mailto:cowan@...] ... Not much of an advantage -- all Forth needs to catch up is a way to declare words without defining them. In fact,...
560
John Cowan
cowan@...
Mar 29, 2001 11:06 pm
... And may we all find Joy! ... It doesn't. Merely typing in a word causes it to go on the symbol table with a null definition, as in Lisp or Scheme. ... ...
561
Billy Tanksley
wtanksley@...
Mar 29, 2001 11:40 pm
From: John Cowan [mailto:cowan@...] ... As we've discussed, Joy really has no symbols either. When you say "[foo] first", as mentioned, you don't get a...
562
John Cowan
cowan@...
Mar 30, 2001 3:47 am
... Granted. I must confess I have not read all the archives yet. ... What functions would you want? Ask now, and they might get implemented! ... It doesn't...
563
Reuben Thomas
rrt@...
Mar 30, 2001 10:05 am
... However, old-style words that accept counted strings (where the count is stored before the string) still, unfortunately (but understandably) dictate that...
564
John Cowan
cowan@...
Mar 30, 2001 5:55 pm
... So much for instant inlining, though! In fact, no one can do any better than "inline words whose definitions you know, don't inline if you don't". ... ...
565
Billy Tanksley
wtanksley@...
Mar 30, 2001 7:48 pm
From: John Cowan [mailto:cowan@...] ... The main thing which would help is some standard for what happens when you're juggling a function. For example,...
566
John Cowan
cowan@...
Mar 30, 2001 8:12 pm
... Okay, so you want combinators to accept functions. Easily done. Currently, of course, you can make it happen thus: DEFINE I == [i] [[] swons i] iflist. ...
567
Billy Tanksley
wtanksley@...
Mar 30, 2001 8:20 pm
From: John Cowan [mailto:cowan@...] ... Something we can agree on :-). ... Yup. :-) ... -Billy...
568
John Cowan
cowan@...
Mar 31, 2001 4:40 am
Right now, Joy primitive words are often polymorphic/generic/overloaded; for example, "concat" applies equally to a pair of strings, sets, or lists. However,...
