... My apologies for the late reply - I've been a bit preoccupied lately. What I meant is that it might be possible to construct functions that can reorder the...
... [..] ... I read your post when it first came out, and I have been stewing over the expression "linear syntax" for a while now. Possibly I am reading things...
I have been working more on various reproducing programs in Joy, quite different from the infinite ("lazy") lists. Most of them do something apart from...
http://www.latrobe.edu.au/philosophy/phimvt/joy/jp-survrep.html ?? ... From: <phimvt@...> To: <concatenative@yahoogroups.com> Sent: Wednesday,...
stevan apter
sa@...
May 18, 2005 10:08 am
2474
... I would say that Forth could be made ALMOST flat by defining all the if and loop operators to take addresses (rather than using the current nested...
i've been studying david turner's language SASL, the ancestor of miranda and other FPLs. for some time now i've wondered what a lazy vector language would...
stevan apter
sa@...
May 19, 2005 3:42 pm
2476
explaining this sort of thing sure does concentrate the mind - i realized that (i) i wasn't handling the empty case, and (ii) i can dispense with the start ...
stevan apter
sa@...
May 19, 2005 4:51 pm
2477
... Yes, ?? indeed. I don't know what went wrong this time, but I do know something is not working. I used Safari (that's the web browser on this silly eMac) ...
... Yes, I thought that what I was talking about was not too far from being part of Forth already. I do not agree, though, that flatForth would have to take...
... I remember SASL, although I never had access to one, or to Miranda. I have toyed with Huggs (or Gofer?), an early implementation of (a subset) of Haskell....
... Interesting. This is what Wippler is doing for his 'vlerq' project, which is centered around a concatenative, vector-based language -- I don't know whether...
... Ambitious. A question: when you say "an implementation of K", do you mean "an open source reimplementation of K written in some freely distributable ...
... then i'm afraid there must be wailing and lamentation and gnashing of teeth, since i mean the second. btw, here's the compiler. given x = a list of...
sa@...
May 20, 2005 2:25 pm
2484
... I agree with that, although I don't agree that it's fully flat either. I was offering not a contradiction of your solution, but an alternate way of doing...
... From: <phimvt@...> ... or foolhardy, which i suppose is often mistaken for courage. :) no doubt you're recalling something like this: the...
stevan apter
sa@...
May 22, 2005 1:59 pm
2486
I'll be away in Europe for five weeks. I won't have easy access to my mail unless I venture to some internet cafe - but no guarantees. I had hoped to respond...
i suppose this is all a bit off-topic, since we're here to discuss matters concatenative, but i thought i'd post a status- report on my project to embed k in a...
sa@...
May 31, 2005 3:54 pm
2488
... not a good example - in fact, * (like all k primitives) is strict: *x fully evaluates its argument, then takes the first. this is a better example: first...
stevan apter
sa@...
Jun 1, 2005 12:00 am
2489
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...
