Ramblings about lists of values and lists of programs: There has been some discussion as to whether in Joy-like language [1 2] is a list of values, or a list...
... I think having two representations is indeed a good idea, with a weak hashtable to connect the list object to the compiled-code object (so that if the list...
http://math.boisestate.edu/%7Eholmes/holmes/sfdocs.pdf an interesting concatenative language by set theorist Randall Holmes....
sa@...
Jun 9, 2006 5:05 pm
2835
my take on the idea of functional variant of false: http://www.nsl.com/papers/ffalse.htm the code is here: http://www.nsl.com/k/ffalse.k my version retains van...
stevan apter
sa@...
Jun 14, 2006 9:35 pm
2836
I have released a new version of the Cat interpreter and overhauled the documentation at http://www.cdiggins.com/cat/ Christopher Diggins [Non-text portions of...
i've wrapped up work on functional False, which i'm calling "F", and i've started writing some simple programs in the language. for example, here's the...
stevan apter
sa@...
Jun 18, 2006 5:04 pm
2838
... i lied. the implementation i described was a modification of one i wrote for False, and was, for that very simple language, just adequate. False has...
sa@...
Jun 21, 2006 4:10 pm
2839
The current version of the Cat language borrows the define statement from the Joy language (with a slight syntactic variation), but I have observed that if I...
I see no problem with that. It is just a personal preference to avoid overloading "=" and to place the symbol argument first. So I could easily define def in...
... This allows redefinition of functions at runtime, which Joy deliberately does not: symbols are defined at load time only. If they can be redefined at...
".. introduces state ... " Good point John. Here is a possible (but not completely thought out) solution: allow the definition of symbols as special hash-table...
here's how you might adapt what is essentially the k solution to the problem of variables. introduce dictionaries as a first-class datatype. let's use your $...
stevan apter
sa@...
Jun 22, 2006 9:03 pm
2845
"controls" [pair![dupd!]$'!$swap!false!pair!@!] cond "[c][t][f]cond!" [[]cond!] if "[c][t]if!" ...
stevan apter
sa@...
Jun 22, 2006 9:08 pm
2846
... solution to the problem of variables. That is essentially what I was proposing, just not as elegantly presented. Thanks for that explanation. - Christopher...
... A few thoughts: If a program is a first-class value in your language then using "=" for assignment of these values seems natural. (Assuming a symbol can ...
i can't possibly express how wrong-headed i think this is. = is a function from values to truth-values. assignment has a side-effect. besides, if symbols are...
stevan apter
sa@...
Jun 23, 2006 2:09 am
2849
... There's not enough context for me to figure what you mean by "this". (It's something I wrote, right?) ... In what I wrote, I was assuming '=' was a...
I am sorry I have not been able to take part in the interesting discussions on the group. I have emptied my house of 34 years, disposed of accumulated junk...
... From: "Joe Bowbeer" <joe.bowbeer@...> To: <concatenative@yahoogroups.com> Sent: Thursday, June 22, 2006 11:56 PM Subject: Re: [stack] Define...
stevan apter
sa@...
Jun 23, 2006 9:51 am
2852
map in F: [[dup!count!]$[pair![]swap!!]$swap! [';$dup![swap!'!$]$pair![swons!]$!] do!%%\] map! "[..][f]map!" for...
sa@...
Jun 23, 2006 2:06 pm
2853
... F is a facinating language. I've spent a while trying to read some of your code; not because it's especially hard to read, but because the math is...
hi billy - nice to see i've snagged your attention (awoken you from your concatenative slumber?) actually, a word leaves not its address on the stack, but its ...
sa@...
Jun 23, 2006 6:26 pm
2855
... Indeed :-). ... Right; my typo. I can see that one (of many) nice things about that is that there are no "special" words. Classic Forth has a few different...
... thanks - yeah, i think so. ... in K (k2). i think the only primitive which would be difficult to implement in another language (e.g. scheme or c) is @,...
stevan apter
sa@...
Jun 23, 2006 9:59 pm
2857
... There are C implementations of many K verbs (to varying degrees of correctness, but I believe @ is fine) in ...
and a guest appearance by the one and only eiz. say a few words into the microphone eiz. ... From: "Mackenzie Straight" <eizneckam@...> To:...
stevan apter
sa@...
Jun 24, 2006 12:31 am
2859
... here's a concrete example where the F approach comes in handy. i was working on the 'converge' combinator this morning. 'converge' expects a quotation q...
stevan apter
sa@...
Jun 25, 2006 6:02 pm
2860
how would you write joy's 'stack' and 'unstack' functions in terms of the remaining primitives? in trying to solve this problem for F, i was led to alter...
sa@...
Jun 27, 2006 4:02 pm
2861
... [...] ... That's a great solution to implementing stack and unstack. Any function that depends on the depth of the stack for its operation, however, is by...
