APL Since 1978 [pdf]
dl.acm.org
dl.acm.org
Incidentally, the issue from which this comes is called "No. HOPL": https://dl.acm.org/toc/pacmpl/2020/4/HOPL. I'm not sure if it's in place of, or in addition to, HOPL IV which was postponed: https://hopl4.sigplan.org .
For q, they are stored as lists of lists, which can mean that their memory is not contiguous. Some algorithms can slow down significantly as a result (eg dense), others might speed up (eg sparse)
However, there are libs in q such as qml which interface with LAPACK and are doing memory mapping so it is not entirely q, just an interface to a C implementation
Looking at the link, Q is only 10% slower for big matrices. I can't imagine this being possible without major optimization on q's part since lapack is insanely optimized.
Downloading PDF from Archive.org does not require cookies.
https://web.archive.org/web/20200612214124if_/https://dl.acm...
APL was popular in the operations research community, and those people are now mostly R users (but they left APL to SAS, Stata, S/S+ and a few others through the years, before adopting R)