High-performance Tree Wrangling, the APL Way // Aaron Hsu // Dyalog '18

Why HN readers recommended it

HN recommends it as a striking example of high-performance tree handling with array programming.

This is a summary from the source dataset, not an endorsement by Hacker News or the video creator.

Video & recommendation details

Creator / channel

Dyalog User Meetings

Topic

array programming trees

Format

talk

Level

advanced

HN recommenders in dataset

3

HN mentions in dataset

3

Recommendation years in dataset

2019–2021

These counts and years describe the included Hacker News records; they are not YouTube views or the video’s publication date.

From the original HN conversations

Excerpts from the recorded comments. Follow each source for the full comment and surrounding discussion.

• Qualification: I was introduced to FP a number of years ago and have finally reached a point where I feel that I have a deep understanding of FP in general. In my mind, Haskell is the "best" language out there ("best" in that it provides …

• I had this feeling exactly listening (great, as everything Aaron does) presentation about manipulation and transformation of trees in APL, [VIDEO]

• > " his saves on allocations, saves on total memory usage " Co-Dfns is Aaron Hsu's project, and he has a talk[1] on a compiler implemented in a nano-pass style, once in Racket, once in Chez Scheme[2] and once in Dyalog APL, each using CPU …