Reading through the wiki piece, the similarity between the matrix operation paradigm of APL and the set operations of the RM came to mind once again. Turns out Codd wrote this paper on using the two together.
And there were the legendary one liner contests:
There were soon contests to see who could find a one-line version of an algorithm previously thought to require many. Sometimes this improved clarity. Sometimes it had the opposite effect, and brevity trumped readability.
The point was about the same as Obfuscated C contests, I suppose.
RStudio maps alt- to <-, so it's no burden.
No comments:
Post a Comment