... Not in general. If the data transport mechanism is explicit, then the written data transport will vanish only when the data transport needs are simple in...
3435
stevan apter
sa@...
Jul 10, 2007 2:38 pm
for clarity, nothing beats a 2-d notation with peirce's "lines of identity" connecting input and output. for example, consider some set of functions f ......
3436
kuwabatake
Jul 10, 2007 5:47 pm
... entity. So I ... Good catch. That makes what I was saying come closer to making sense :) ... From here, I see two options: 1. You've convinced me, I'll...
3437
Christopher Diggins
cdiggins.geo
Jul 11, 2007 11:51 pm
I've just written a short (and hopefully accurate) tutorial on Mondas in pure-functional stack-based languages: ...
3438
Chris Double
doublecnz
Jul 12, 2007 12:27 am
... Why rewrite using so many invocations of dip? Couldn't you rewrite to: ... [ 1 2 + ] dip .x swap * ... Chris. -- http://www.bluishcoder.co.nz...
3439
Christopher Diggins
cdiggins.geo
Jul 12, 2007 1:04 am
Yes there is no real reason not to use "dip" throughout. I just thought that just would makes more explicit what the term rewriting strategy should be. ... ...
3440
John Carter
refactored
Jul 12, 2007 1:28 am
... Any pointers to candidates for the "simplest possible data transfer notation"? John Carter Phone : (64)(3) 358 6639 Tait...
3441
Daniel Ehrenberg
littledanehren
Jul 12, 2007 1:37 am
What does that have to do with monads? The link that you included also doesn't have to do with monads. I feel like I'm missing something here. Daniel Ehrenberg...
3442
William Tanksley, Jr
wtanksle
Jul 13, 2007 2:27 pm
... The comments on your post are interesting, especially the paper someone pointed to <http://www.cs.nott.ac.uk/~ctm/IdiomLite.pdf>. I don't know how useful...
3443
William Tanksley, Jr
wtanksle
Jul 13, 2007 2:30 pm
... None aside from the clue I just gave. I don't think it exists ... yet ..., and I don't know how to build it. I have a vague suspicion that it'll involve a...
3444
Christopher Diggins
cdiggins.geo
Jul 13, 2007 4:48 pm
... It would be good to have more eyes on the subject. I am pretty good at mucking things up the first time around. :-) ... I may not understand precisly what...
3445
Christopher Diggins
cdiggins.geo
Jul 13, 2007 5:04 pm
... This is an interesting point. Specifying an ordering where non is intended, I believe can be considered to be simpler than differentiating between the two....
3446
Christopher Diggins
cdiggins.geo
Jul 13, 2007 5:09 pm
This is an approach which I am unfamiliar with, and it does appear to be very powerful. Thanks for sharing it! ... [Non-text portions of this message have been...
3447
Christopher Diggins
cdiggins.geo
Jul 13, 2007 5:22 pm
... Thank you. ... I like this a lot. This does a good job of summing up what I like about point-free form very elegantly. One point though, is "explicit"; the...
3448
William Tanksley, Jr
wtanksle
Jul 13, 2007 5:32 pm
... You're right that it would increase grammar complexity (although perhaps it would coincidentally remove some other aspect of the grammar; I don't know)....
3449
William Tanksley, Jr
wtanksle
Jul 13, 2007 5:37 pm
... Actually, I think John made a mistake in another word: the mechanism for moving _values_ from source to consumption is explicit. You're not moving...
3450
William Tanksley, Jr
wtanksle
Jul 13, 2007 10:20 pm
... Perhaps you're right, and his work could lead to a semantic understanding of local variables in a concatenative context. ... Yeah, so do most...
3451
John Cowan
johnwcowan
Jul 13, 2007 10:49 pm
... Well, at least we know how to translate linear (use-once) variables into concatenative notation, thanks to Henry Baker: ...
3452
Daniel Ehrenberg
littledanehren
Jul 14, 2007 4:13 am
... I agree. I don't understand why stack-based languages should have locals. There are a few edge cases where variables might be necessary, and as far as I...
3453
John Carter
refactored
Jul 16, 2007 1:39 am
... Aha! Here we have the meat of it. Yes, having an unorder data type is implementationwise more complex, but semantically simpler. I suspect "unordered set"...
3454
Manfred Von Thun
maggethun
Jul 16, 2007 8:29 am
On 16/7/07 11:34 AM, "John Carter" <john.carter@...> wrote ... One criticism of Joy has been that because there are no names for formal parameters...
3455
William Tanksley, Jr
wtanksle
Jul 16, 2007 3:16 pm
... Actually, an ordered data *type* is simpler in every way. But we weren't talking about data types; we were talking about the ability to specify dataflow....
3456
Christopher Diggins
cdiggins.geo
Jul 16, 2007 4:30 pm
... I'm simply doing a poor job of saying what I mean. What I was trying to say is that composition is always left-right, but that subterms could be evaluated...
3457
William Tanksley, Jr
wtanksle
Jul 16, 2007 5:48 pm
... Yes, you're right. The missing definition is what a "subterm" is. Unlike most languages, a subterm is not a grammatical concept; it's defined semantically,...
3458
John Carter
refactored
Jul 16, 2007 10:56 pm
There is a lot else in your response worth reading and perhaps commenting on... But I couldn't resist a quickie... ... The essence of the point under...
3459
William Tanksley, Jr
wtanksle
Jul 17, 2007 2:57 pm
... Yes, and furthermore, I meant that as a light toss-off joke. I also intended to discuss the issue further, and forgot to. My mistake; I made it look like I...
3460
John Carter
refactored
Jul 17, 2007 9:22 pm
... Do you have some URL's for those languages? I can't seem to lay my Googly fingers on them. ... I'm also brewing something that is looking fun. I love these...
3461
William Tanksley, Jr
wtanksle
Jul 17, 2007 10:24 pm
... NIAL is the open source one; APL, J, and K are to one extent or another proprietary. I think K and NIAL are the best bets; J is good, but K is more...
3462
stevan apter
sa@...
Jul 18, 2007 1:56 pm
i'm not following this. a list has an order but you can ignore it. in k at least, you can build a "map", e.g. v:`x`y`z!10 20 10 so v.x = 10, v.y=20, &c. of...
3463
William Tanksley, Jr
wtanksle
Jul 18, 2007 2:45 pm
... Yes, but iteration over a list is ordered. That's the sort of minor distinction that can wind up making a difference in a heavy computation; especially...
