BQN for birdwatchers (2021)

There's a tutorial explaining BQN's combinators not directly linked: https://mlochbaum.github.io/BQN/tutorial/combinator.html

The symbols ⊸ and ⟜ are new in BQN and I think these are a good example of how APL's symbolic approach can make it easier to think about combinators. You have w F⊸G x meaning (F w) G x and w G⟜F x meaning w G (F x), that is, the function on the pointy side is a preprocessing step for the argument on that side. Once you get used to which side is which these become some of the most intuitive BQN combinators to work with.

I really enjoyed the video "Composition Intuition" by Conor Hoekstra: https://www.youtube.com/watch?v=Mj8jxYS-hi4

Related: A programming language that only consists of combinator birds! https://esolangs.org/wiki/Birb

I was meaning to follow this up. They were recently talking about this on the arraycast and it feels like a fun intersection of interests. Also glad to see this hit hn otherwise it would have been pushed of my proverbial stack