4 ms·

Do you have a link to such an example of Aaron's code? Thank you in advance!

082349872349872 2y ago
https://scholarworks.iu.edu/dspace/items/3ab772c9-92c9-4f59-bd95-40aff99e8c7a 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/n65/mode/2up https://archive.org/details/aprogramminglanguage1962/page/n6...
- gsf_emergency 2y ago
  Thanks. Was hoping for low-level code that might even blow a deue(I?)ng(m?)ker's mind on THE semantics-syntax duality.. This was closest: https://www.dyalog.com/blog/2018/01/stackless-traversal/ https://www.dyalog.com/blog/2018/01/stackless-traversal/ Your links should still be useful for orienteering!
agumonkey 2y ago
Can't remember where exactly but he did demo his code in talks/conferences with links.
- gsf_emergency 2y ago
  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 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/prerequisites/TP2Prerequisites.pdf https://www.dyalog.com/uploads/conference/dyalog16/prerequis... *Bad faith, or just a run o' the mill, aka compleatly forgiveable profiteering?
  - gsf_emergency 2y ago
    Ahh apologies https://news.ycombinator.com/item?id=13797797 https://news.ycombinator.com/item?id=13797797 https://news.ycombinator.com/item?id=13576176 https://news.ycombinator.com/item?id=13576176
    - 082349872349872 2y ago
      He must be referring to https://dl.acm.org/doi/pdf/10.1145/2935323.2935331 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 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 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/n66/mode/1up 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 [all three appear to be 1-origin, probably due to the phenomenon mentioned in the footnote on p49 of APL]
      - gsf_emergency 2y ago
        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.com's workflow. https://news.ycombinator.com/item?id=11974936 https://news.ycombinator.com/item?id=11974936 >Bernecky https://news.ycombinator.com/item?id=11963548 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..]

https://scholarworks.iu.edu/dspace/items/3ab772c9-92c9-4f59-bd95-40aff99e8c7a 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/n65/mode/2up https://archive.org/details/aprogramminglanguage1962/page/n6...

gsf_emergency 2y ago
Thanks. Was hoping for low-level code that might even blow a deue(I?)ng(m?)ker's mind on THE semantics-syntax duality.. This was closest: https://www.dyalog.com/blog/2018/01/stackless-traversal/ https://www.dyalog.com/blog/2018/01/stackless-traversal/ Your links should still be useful for orienteering!

agumonkey 2y ago

Can't remember where exactly but he did demo his code in talks/conferences with links.

gsf_emergency 2y ago
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 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/prerequisites/TP2Prerequisites.pdf https://www.dyalog.com/uploads/conference/dyalog16/prerequis... *Bad faith, or just a run o' the mill, aka compleatly forgiveable profiteering?
- gsf_emergency 2y ago
  Ahh apologies https://news.ycombinator.com/item?id=13797797 https://news.ycombinator.com/item?id=13797797 https://news.ycombinator.com/item?id=13576176 https://news.ycombinator.com/item?id=13576176
  - 082349872349872 2y ago
    He must be referring to https://dl.acm.org/doi/pdf/10.1145/2935323.2935331 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 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 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/n66/mode/1up 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 [all three appear to be 1-origin, probably due to the phenomenon mentioned in the footnote on p49 of APL]
    - gsf_emergency 2y ago
      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.com's workflow. https://news.ycombinator.com/item?id=11974936 https://news.ycombinator.com/item?id=11974936 >Bernecky https://news.ycombinator.com/item?id=11963548 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..]