Is Haskell a Better Array Language?

The only one where apl is the winner I think beak is a so of the eight problems I think bqn probably wins five times Haskell wins twice and apl wins once. In every other language you have to do something a little bit more verbose or it's something not as elegant. So like in general I think bQn has a lot more things like under and inverse and all more combinators and the sort primitives and I could go on and on but no one else is going to make that video.

Transcript

Play full episode

Remember Everything You Learn from Podcasts

Save insights instantly, chat with episodes, and build lasting knowledge - all powered by AI.