APL Since 1978 (2020) [pdf]
dl.acm.org
dl.acm.org
A next generation APL might make sense. No, it isn’t J. That’s an abomination. I have written about this on HN in the past.
Additionally these kind of languages are much more ergonomic for GPPGU, and I expect them to eventually get more adoption into that space.
Go to a job site and search for APL jobs to get a sense of what reality looks like in the APL world.
https://aplwiki.com/wiki/Conferences_and_activities
Many people are more than happy working on a niche field, not everything has to be career scale.
K's are often used as a sort of efficiency language. Often allows you to get the same work done in 1/1000th the code managed by 1/10th the staff running on 1/10th the hardware.
Anyway, these things are cyclical.
If you search for APL and my username in HN you should be able to find opinions on this going back several years.
I think anyone interested in this kind of thing should just intern one of them ; you basically need so see every compute problem as an array problem and immediately see patterns for how to solve them. The 'gibberish' (as programmers not used to these kind of languages see it) is typically not written char for char, but the experienced programmer has idioms; when they encounter a problem seen before, an entire 'function' plops out, often shorter than a function performing the same task in another programming language would be name. Once there, the other ones are kind of more of the same. It's not very different from the first encounter with haskell or lisp or something; if you are not proficient, you won't see the advantage (or even think people using it are not totally sane).
But did you see / try BQN? I think it's an interesting attempt. And well built.
I was briefly a commercial APL programmer, after APL blew my mind in college. (An IBM 1130 running Fortran punched cards was the competition.) How much mileage one can get from "Every problem as an array problem" was APL's singular lesson for me, to this day.
In the same idea box for me: Monadic parsers in Haskell can be mind-blowing, but every problem isn't a string problem. Every problem is a algebraic data structure problem. They can be parsed and transformed as a natural generalization of strings. And, I love Lisps but they are as stuck in the past as APL, I truly believe that in 1,000 runs of the simulation our world would come out bottom 10% on how naturally we manipulate macros. Macros look strapped on; we're living in a first draft.
The goal of any advanced programming language should be to expose the thought process as a form of algebra, so we can learn to fly. APL did this well for its time. This is the appeal of languages like Haskell. We have barely scratched the surface of the algebra of parsing combinators, as a potential backbone for programming.
My imagined successor to APL is in spirit only: It is so agile at implementing macros as monadic parsing of algebraic data types that all other problems become easy.
The syntax for defining functions is also a bit different, but better in my opinion.
You can find some information here: https://kapdemo.dhsdevelopments.com/
[0] https://www.t3x.org/klong/book.html
Edit: Klongpy looks excellent; nice work!!