hackertube.io

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

Dyalog User Meetings · talk · Watch on YouTube

Programming language designAlgorithms & data structuresSoftware performance & optimization

What it is

Aaron Hsu shows how to manipulate and transform tree data in APL using arrays and inverted tables instead of pointers. He claims much smaller code, better performance and easier parallelisation.

Why Hacker News recommends it

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

  • 3 people recommended it
  • 3 different months
  • 0 strong recommendations
  • first 2019, last 2021

What HN commenters said

  1. “Or how to model Trees without using pointers by using "Inverted Tables.”

    Models trees without pointers using inverted tables in APL.

    kadblas, 2019-06 · Recommendation · in “Why I think Haskell is the best general purpose language as of June 22 2019”

  2. “great, as everything Aaron does”

    Great presentation on manipulating and transforming trees in APL.

    snaky, 2020-01 · Recommendation · in “Language as an intellectual tool: From hieroglyphics to APL (1991)”

  3. “He has one talk (available on YouTube) about his approach to using arrays to working with tree structures in a high-performance way in APL”

    Array approach to high-performance tree structures in APL.

    jodrellblank, 2021-06 · Recommendation · in “Zig 0.8.0 Release Notes”

Excerpts from Hacker News comments, linked to the originals. Summaries and labels were written by a language model from those comments.

Topics: apl, trees, inverted tables, array languages, dyalog

Also recommended by the same people