I liked the original ideas and the discussions on this topic. Just a few brief comments: What you called ³eager² and ³lazy² macros seems to correspond...
... That's pretty nifty. I wrote some pattern matching routines for Factor a while back and for fun implented a 'shuffle' word that used it to do stack...
I'm not quite sure where this notion fits in relative to concatenative languages, but I suspect there may be some common ground. First some background so that...
It is perhaps interesting to mention the equivalence of stack shuffling notation and lambda expressions (other languages) which was identified by Brent Kerby...
... Yes, although there's nothing interesting about the fact that those are equivalent to lambdas -- they are, prima facia, lambdas, since they create a...
... No, I would say they are more dynamic and very close to Lisp macros. ... Eager macros are very useful to efficiently generate or compile code. Let's say...
i've implemented several versions of this, in XY, and then again in F and G (http://www.nsl.com/k/f/f.htm) in F/G: A pattern is a list whose head is a scheme...
stevan apter
sa@...
Jan 5, 2007 3:12 pm
3132
... I think you're probably right. I just did some work with the shuffle notation I proposed in my last post, which provided for stack shuffle and execution...
... From: "John Cowan" <cowan@...> To: <concatenative@yahoogroups.com> Sent: Friday, January 05, 2007 3:52 PM Subject: Re: [stack] Concatenative macros? ...
stevan apter
sa@...
Jan 5, 2007 10:33 pm
3136
... My system tries not to specify the shape of lists -- I consider it a bad habit. Even being able to take apart lists is mathematically problematic within a...
between you and john, i now understand the point about "improper lists". i think the two notations can be made equivalent by adding a special symbol to each. ...
stevan apter
sa@...
Jan 6, 2007 12:17 pm
3138
Hi. Before I get to my main topics, I'd like to suggest some ideas for thread topics (some of which may already have been used, but I haven't yet gone over all...
... Yes, that would make them equivalent (although "." wouldn't mean 'nil' for me; instead, it would be a code that meant that the previous item was the end of...
My Joy engine is an "object" that allows the calling code to use Joy as an internal macro or scripting language. Each instance is independent of any others, so...
About the editor described in my previous post: For Joy "syntax" highlighting, I plan to flag the brackets for lists and sets, do color-flagging for comments,...
[Skip or just skim the following if you are tired of discussing local variables; there's probably nothing new here. I'm offering this just in case there is...
It's the LAW: Whenever a programming language is developed that eliminates the need for some conventional programming construct, that programming language will...
[This is rather long. You may want to just skim it first time through, to see if it's even something you want to bother with.] Imagine a version of Joy in...
... From: "William Tanksley, Jr" <wtanksleyjr@...> To: <concatenative@yahoogroups.com> Sent: Saturday, January 06, 2007 8:56 PM Subject: Re: [stack]...
stevan apter
sa@...
Jan 8, 2007 1:16 pm
3146
... From: "cpcogan" <ccogan@...> ... welcome back chris. your posts are unfailingly interesting, and they've been missed....
stevan apter
sa@...
Jan 8, 2007 1:25 pm
3147
... From: "cpcogan" <ccogan@...> To: <concatenative@yahoogroups.com> Sent: Sunday, January 07, 2007 5:40 PM Subject: [stack] Comments on Trade-Offs in...
stevan apter
sa@...
Jan 8, 2007 3:43 pm
3148
... It's too late for me -- save yourselves! Thanks, Stevan. I appreciate you throwing me a new challenge when I don't even have enough time to deal with...
I finally figured out the one combinator basis for Cat def aba { [dup] dip swap } def fcons { [quote] dip compose } def K { [pop] dip eval } def S { [aba] dip...
... That's the Rosser X combinator. The Fokker X combinator is something like: def Xf { [nip nip i] [S] rot i } (I hope I got the Cat right.) ... The same...
I don't know if this is original or not, but I defined a large set of stack shuffling operations using a very simple mnemonic device. def aba { [dup] dip swap...
... This is precisely why I advocate defining a simple shuffle syntax -- it's just so common to want something that's easy to ask for, but hard to remember how...
... From: "William Tanksley, Jr" <wtanksleyjr@...> To: <concatenative@yahoogroups.com> Sent: Tuesday, January 09, 2007 12:27 PM Subject: Re: [stack]...
stevan apter
sa@...
Jan 9, 2007 8:30 pm
3154
... The next logical step then seems to be to simply drop the "-", and use the library defined "abac" function that I proposed. Now you don't have to change...
