a SLACK program consists of an expression followed by zero or more definitions: expression {definition} ... {definition} a definition has the form {name...
stevan apter
sa@...
Jun 5, 2005 11:52 pm
2490
a SLACK script is a text file containing zero or more SLACK programs (see below.) each program begins in column 1, and subordinate definitions are indented at...
sa@...
Jun 7, 2005 5:04 pm
2491
common sub-expression elimination works nicely. example: the execution tree for the expression (!3)+!3 is (*unicode alert*): show"(!3)+!3" ...
stevan apter
sa@...
Jun 7, 2005 10:52 pm
2492
oops - what a mess. here's the ascii version of that ... common sub-expression elimination works nicely. example: the execution tree for the expression ...
stevan apter
sa@...
Jun 7, 2005 10:58 pm
2493
... I don't know whether my definition matches how other people were using the word, but I just realised that the perfect way to produce flatness is with a...
... a small XYish interpreter, with a queue and stack: store a and b as tokenized strings, viz. 2 / ] [ 10 now interpret as follows: a -> append val(a) to the...
sa@...
Jun 16, 2005 6:23 pm
2495
Many of you are probably aware of this but for the few that aren't this is just a reminder that the ICFP (International Conference on Functional Programming)...
i hear that dan is working on an infix parser for factor. here's a short introduction to the notation invented by ken iverson, and used in APL, J, and K. it...
stevan apter
sa@...
Jun 26, 2005 2:07 pm
2497
gcc 4.* has a new optimizing back end. For a c compiler, it is a remarkably "functional" type notion. It's called tree-ssa. Basically the intermediate...
Stevan, I think this description is wonderful. Just to make sure I'm following everything ... ..snip ... I assume unary should be "u", based on the explanation...
... From: "ori_berger" <ori_berger@...> To: <concatenative@yahoogroups.com> Sent: Sunday, June 26, 2005 6:43 PM Subject: [stack] Re: infix syntax -...
stevan apter
sa@...
Jun 26, 2005 11:07 pm
2500
my paper on SLACK has reached "first draft" stage: http://www.nsl.com/k/slack/slack.htm and a summary will eventually follow. meanwhile, i continue to...
sa@...
Jul 5, 2005 2:58 pm
2501
While I was away I have been thinking about flatness, macros(or other definitions), and concatenative semantics. In what follows, by "standard languages" I...
... using ... flatness ... lazy, ... and ] ... level ... conditional ... Consider the following Joy program: LIBRA cpop == [pop] [] branch . cpop is the...
... Right -- I would go on to say that the reason concatenative languages are interesting to work in is that the semantics of the language (sequential...
... From: "William Tanksley, Jr" <wtanksleyjr@...> ... this hovers just beyond my ability to comprehend. [ and ] are functions. but functions of what to...
stevan apter
sa@...
Jul 14, 2005 11:05 am
2506
... now that i think about it, this probably doesn't work. if [ and ] are functions, then how do you produce the quotation [ [ ] i.e. the list whose sole...
stevan apter
sa@...
Jul 14, 2005 11:32 am
2507
the, or at any rate *one* answer is: since [ and ] are functions, quote them. e.g. in XY 2 3 \+ pushes 2, then 3, then + onto the stack. so [ \] ] [ ] ] [...
sa@...
Jul 14, 2005 6:13 pm
2508
i hope no one minds that i continue to post my thoughts on this topic. at first, i thought that flatness was inconsistent with intensional lists (quotations),...
sa@...
Jul 15, 2005 12:47 pm
2509
... To make sure I understand this: in Joy, the square brackets have two jobs: they signify both lists and quotations. You have separated these, so that []...
... Yes, I think so, but I think your way of putting it is confusing, given that in Joy "quotation" means a list suitable for execution. Square brackets ...
in XY (either version) [ \\ ] [\] that is, you can quote the quotation operator. in other words, quotation is first-class....
sa@...
Jul 15, 2005 5:18 pm
2512
... since all lists are suitable for execution, in joy, "list" and "quotation" are just different names for the same thing. i suppose you could make the...
sa@...
Jul 15, 2005 6:05 pm
2513
... Well, not quite. A list some of whose members are undefined symbols is not suitable for execution. ... My intuitions are quite otherwise: a list is a...
... not in Joy, i agree. in XY, the value of an undefined symbol x is x. e.g. undefined undefined [2 foo 3] i 2 foo 3 ... and ... so you think that quotation...
sa@...
Jul 15, 2005 6:53 pm
2515
... From: "William Tanksley, Jr" <wtanksleyjr@...> To: <concatenative@yahoogroups.com> Sent: Thursday, July 14, 2005 12:12 AM Subject: Re: [stack] stack...
stevan apter
sa@...
Jul 16, 2005 12:10 pm
2516
the following is a (slightly edited) conversation which took place on #concatenative earlier this morning. comments? ... <eiz> How is 'flatness' in any way...
stevan apter
sa@...
Jul 16, 2005 5:27 pm
2517
... Why? ... I don't think I made that claim -- did I? I claim only that a lazy concatenative language could be _perfectly_ flat (in the sense that any valid...
