41–50 of 52 posts
Cool! Carbon is doing exactly this. I had asked leads if there was a paper on this approach, but they didn't have anything for me. I'll send them this post!
Chandler discusses it in this video though! https://youtu.be/ZI198eFghJk You get some traversals for free with this layout (preorder, reverse post order). Can search for subtrees with string searching algorithms or more complex things with regex.
Earlier quoted context omitted.
Do you have a link to such an example of Aaron's code? Thank you in advance!
Can't remember where exactly but he did demo his code in talks/conferences with links.
Does APL need a type system
Guess it's time to reverse whatever else I can find
https://www.dyalog.com/uploads/conference/dyalog16/prerequis...
*Bad faith, or just a run o' the mill, aka compleatly forgiveable profiteering?
Earlier quoted context omitted.
Do you have a link to such an example of Aaron's code? Thank you in advance!
https://scholarworks.iu.edu/dspace/items/3ab772c9-92c9-4f59-... Iverson's 1962 book also mentions tree representations, see pp45-62: https://archive.org/details/aprogramminglanguage1962/page/n6...
This was closest: https://www.dyalog.com/blog/2018/01/stackless-traversal/
Your links should still be useful for orienteering!
Earlier quoted context omitted.
Can't remember where exactly but he did demo his code in talks/conferences with links.
I've given up on finding relevant low-level CUDA(? tacit? asm??!!) code from Hsu*, but I did push the following to my to-watch stack https://youtu.be/z8MVKianh54 Does APL need a type system Guess it's time to reverse whatever else I can find https://www.dyalog.com/uploads/conference/dyalog16/prerequis... *Bad faith, or just a run o' the mill, aka compleatly forgiveable profiteering?
Earlier quoted context omitted.
I've given up on finding relevant low-level CUDA(? tacit? asm??!!) code from Hsu*, but I did push the following to my to-watch stack https://youtu.be/z8MVKianh54 Does APL need a type system Guess it's time to reverse whatever else I can find https://www.dyalog.com/uploads/conference/dyalog16/prerequis... *Bad faith, or just a run o' the mill, aka compleatly forgiveable profiteering?
Ahh apologies https://news.ycombinator.com/item?id=13797797 https://news.ycombinator.com/item?id=13576176
Just looking at refs for the moment: Henglein and Hinze's discriminators are interesting, whenever you come back up for air. (are they also amenable to sorting codata?)
The oft-cited R Bernecky is, IIRC, also known as "Boolean Bob" for his SWAR-style algos. EDIT: nope, confused him with R Smith: https://aplwiki.com/wiki/Bob_Smith
(I once asked Boolean Bob if any of his tricks went back to the card processing days —I could even believe the keyed tree* might?— but he was too young to know, and the people he'd have liked to ask are no longer available.)
EDIT: Aardappel also has some interesting languages: https://strlen.com/#programming-languages
* for manipulating Bills of Materials despite the linearity of card decks?
EDIT2: compare "§3.2.1 Constructing Node Coordinates" (p34) with [T in "Table 1.19 Full list matrices of the tree of Fig. 1.16" in A Programming Language (p50): https://archive.org/details/aprogramminglanguage1962/page/n6...
Fc
1 0 0 0 0
1 1 0 0 0
1 1 1 0 0
1 1 1 1 0
1 1 1 1 1
1 1 1 1 2
1 1 1 1 3
1 1 2 0 0
1 1 2 2 0
Ec
1 0 0
1 1 0
1 1 1
1 1 2
1 1 3
1 2 0
1 3 0
1 3 4
1 3 5
1 3 6
Earlier quoted context omitted.
Ahh apologies https://news.ycombinator.com/item?id=13797797 https://news.ycombinator.com/item?id=13576176
He must be referring to https://dl.acm.org/doi/pdf/10.1145/2935323.2935331 ? Just looking at refs for the moment: Henglein and Hinze's discriminators are interesting, whenever you come back up for air. (are they also amenable to sorting codata?) The oft-cited R Bernecky is, IIRC, also known as "Boolean Bob" for his SWAR-style algos. EDIT: nope, confused him with R Smith: https://aplwiki.com/wiki/Bob_Smith (I once ask…
[Too low global b/w to feel the adrenalin.. wow.. what was your deduction chain for figuring how BoMs was next item on my stack? Guessing you started from assumption that pure bits mongering are not on the boundary of my ikigais(yet)]
On the heap, I (re)surfaced "Typed Array Intermediate Language" slides, but too low (local) b/w to try to find out^W^W^W^W sus out if this or smth v similar is already in dyalog.com's workflow.
https://news.ycombinator.com/item?id=11974936
>Bernecky
https://news.ycombinator.com/item?id=11963548
What were those slides about formalizing Euclid ?
[Medium b/w vibing that multiplicity of edits is a precise estimate of flow-of-war, ~ webpage memory usage is an accurate estimate of just how well run the entire organization is..]
Earlier quoted context omitted.
He must be referring to https://dl.acm.org/doi/pdf/10.1145/2935323.2935331 ? Just looking at refs for the moment: Henglein and Hinze's discriminators are interesting, whenever you come back up for air. (are they also amenable to sorting codata?) The oft-cited R Bernecky is, IIRC, also known as "Boolean Bob" for his SWAR-style algos. EDIT: nope, confused him with R Smith: https://aplwiki.com/wiki/Bob_Smith (I once ask…
Thanks! [Too low global b/w to feel the adrenalin.. wow.. what was your deduction chain for figuring how BoMs was next item on my stack? Guessing you started from assumption that pure bits mongering are not on the boundary of my ikigais(yet)] On the heap, I (re)surfaced "Typed Array Intermediate Language" slides, but too low (local) b/w to try to find out^W^W^W^W sus out if this or smth v similar is already in dyalog…
[BoMs were complete coincidence]
Earlier quoted context omitted.
Thanks! [Too low global b/w to feel the adrenalin.. wow.. what was your deduction chain for figuring how BoMs was next item on my stack? Guessing you started from assumption that pure bits mongering are not on the boundary of my ikigais(yet)] On the heap, I (re)surfaced "Typed Array Intermediate Language" slides, but too low (local) b/w to try to find out^W^W^W^W sus out if this or smth v similar is already in dyalog…
still haven't refound the slides — every 5 or 6 weeks I get a new idea of who it might have been, but so far to no avail... [BoMs were complete coincidence]
For an vulpine organ they speak very confidently of the f-o-w
Earlier quoted context omitted.
Thanks! [Too low global b/w to feel the adrenalin.. wow.. what was your deduction chain for figuring how BoMs was next item on my stack? Guessing you started from assumption that pure bits mongering are not on the boundary of my ikigais(yet)] On the heap, I (re)surfaced "Typed Array Intermediate Language" slides, but too low (local) b/w to try to find out^W^W^W^W sus out if this or smth v similar is already in dyalog…
still haven't refound the slides — every 5 or 6 weeks I get a new idea of who it might have been, but so far to no avail... [BoMs were complete coincidence]
https://www.weizmann.ac.il/mcb/alon/sites/mcb.alon/files/use...
Earlier quoted context omitted.
still haven't refound the slides — every 5 or 6 weeks I get a new idea of who it might have been, but so far to no avail... [BoMs were complete coincidence]
Slides & conspiracies.. For an vulpine organ they speak very confidently of the f-o-w https://xcancel.com/benln/status/1873459290562056566
(interesting that 平常心 is unmarked, while in english the desired state of mind[heart] is marked)
No slides yet, but I finally dug up the quotation I'd promised you last year: Körner, The Pleasures of Counting (1996) p.413 ch.17 "Time and chance" in a footnote (arrived at via a path starting with Enigma decodes!):
> Social Darwinism applies the Darwinian doctrine of survival of the fittest to human society. Rich social Darwinists take wealth as the best indication of fitness to survive, academic social Darwinists take intellectual achievements as the best indication and so on. They are often haunted by the fear that the unfit do not understand this and may outbreed the fit.