In a sense Joy is about stopping NameQuakes. In practically every other language every time a function is defined, or a function is invoked, a Name Quake...
From: John Carter [mailto:john.carter@...] ... Why does Joy avoid this? I think I might know what you're saying, possibly. Are you referring to the ...
I'm an idiot -- I don't believe it took me so long to remember POP-11. It's a classic concatenative language, with several alternative syntaxes. Very similar...
Hello Billy, пятница, 4 января 2002 г., you wrote: BT> I'm an idiot -- I don't believe it took me so long to remember POP-11. It's BT> a classic...
Serguey Zefirov
sz@...
Jan 4, 2002 12:54 pm
957
Following is a list of points I ran into working with Joy. I tested on Joy as it was on December 14th, 2001. "=" - Operator: [] "text" = => false "text" [] =...
Silly thought for today. Suppose there existed a fragment L of Joy which commutes with any other fragment. ie. For all C, C L == L C. We could then invent the...
The sources of the program I developed are available now at yahoo/concatenative. I felt free to open a new folder with the necessary files: qref.joy A short...
... This is partly due to the absence of formal parameters in function definitions. In lambda calculus based languages most such definitions use lambda...
Manfred von Thun
phimvt@...
Jan 24, 2002 3:29 am
961
... When our aging DEC10 was retired a lot of documentation was thrown out, and I rescued some POP11 documentation about libraries. There were some intersting...
Manfred von Thun
phimvt@...
Jan 24, 2002 3:51 am
962
... Oh dear, oh dear. Yes. I can't fix them right now because I'm halfway through a largish Joy program - would you believe, a (Eval-Apply) Lisp interpreter...
Manfred von Thun
phimvt@...
Jan 24, 2002 4:04 am
963
... Not silly at all: very interesting and fundamental. I take it that some of your terms come from linear algebra about which I know just about nothing. But I...
Manfred von Thun
phimvt@...
Jan 24, 2002 4:58 am
964
... [details deleted] ... Maybe the last four lines (and possibly smething more) should be in a HELP or README file in the folder. ... Great. I have added a...
Manfred von Thun
phimvt@...
Jan 24, 2002 5:05 am
965
Someone asked (off the list) why I called POP-11 a concatenative language, when it's actually a language environment including several languages, none of which...
... Though Manfred made a good point, stack-based does not necessarily imply concatenative. Indeed, POP-11 doesn't look concatenative to me at all, ie you do...
From: Louis Madon [mailto:madonl@...] ... None of the programs written in it are concatenative. This is clear. The language clearly has many features...
... So you seem to be saying that by overlooking enough detail, POP-11 can be considered "concatenative". That same argument would probably work for quite a...
... languages ... place. Forth ... words to ... That's a consequence of Forth being the only programming language (that I know of anyway) that provides the...
Hello e1_t, ... e> place. Forth ... e> words to ... e> That's a consequence of Forth being the only programming language e> (that I know of anyway) that...
Serguey Zefirov
sz@...
Jan 29, 2002 12:31 pm
972
... In some languages. Latin can't say that; it has to say either "Thomasus et Henricus et Davidus", with full words infixed, or else "Thomas Henricusque...
... [details deleted] ... Thank you very mutch for the link. I'm very proud about it; it's my first! Your wording is fine. I added a README, test-output.txt...
From: e1_t [mailto:e1_t@...] [I stated that POP-11 is an interesting, and possibly informative, example of a primitive concatenative language. Someone...
... access ... of ... with ... get ... helps ... Right, conveniance. The reason why implementation of PARSE was so conveniant in first implementations of Forth...
... example ... parameters). ... access ... words to ... internals; it's ... Right. ... completely ... words, ... As I said it was the case with older Forths...
Hello e1_t, ... e> access ... e> of ... e> with ... e> get ... e> helps ... e> Right, conveniance. The reason why implementation of PARSE was so e> conveniant...
Serguey Zefirov
sz@...
Jan 30, 2002 11:46 am
978
Hello Serguey, SZ> Hello e1_t, SZ> There is an unusual complexity for mantaining stack of unparsed words, Sorry. I should type "unneeded" or "unwanted" instead...
Serguey Zefirov
sz@...
Jan 30, 2002 1:51 pm
979
... It took a bit of googling, but I turned up Omer Zak, software engineer: http://www.zak.co.il/omer/eng/bio.html And Dmitri Kanevsky, theoretical...
From: e1_t [mailto:e1_t@...] ... I think we may have different definitions of "internals". ... No. You can't implement PARSE in C because C code has no...
... language ... implementations ... draw a ... words, ... more Forth doesn't have a stack of unparsed words. It has an input buffer. PARSE simply looks into...
