Embed Notice

Those who know me from the Birbsite have seen this question from me before. It's very much not an "I hate FP" question. I've done a little work with LISP and Racket, enough to see how they work basically. Technical codes don't typically deal with recursive data structures or boundless data structures like streams. Operations on fixed size arrays are far more common; APL's approach is far clearer than that of LISP. While matrix math is a critical aspect of technical code, it's typically a very tiny portion of the overall code - far more code is devoted to intermediate calculations, physical property or phenomena calculations than to matrix multiplication, inversion, conditioning, etc.

Mastodon is a new community I can ask so I'm asking again to find out what I'm missing.