Linear logic is often introduced with unintuitive and contrived examples involving food. For computer scientists, linear logic is well motivated by memory management à la C.
One of the virtues of J is its conciseness; I think this is underrated in exploratory programming. Here I present some J one-liners alongside samples of other languages.
The canonical way to get a perceptual hash is using the pHash library. In fact, we can get nearly the same performance in Haskell using hip and repa.
Here I'd like to show an example of runtime complexity, arising from a practical problem.
A question in compiler design is: what optimizations should a given compiler perform? Optimizations for functional languages in particular are not well-known; it is not obvious which optimizations will provide the greatest speedup on user code.prev | next