"It is easy to reason about strict pure functional language performance. It is uniformly the worst-case."
-
What’s that mean? The last part.
Consider: > foldr const 99 [1..1000000] Under strict evaluation, the asymptotic is the worst case — linear in the list length. Under non-strict evaluation, it is O(1). Strict evaluation is "easy to reason about" because it is always the worst case.
-
-
Oh shit, took me about 5 mins to figure out what the hell "the asymptotic" means, but whoa, non-strict is crazy black magic.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
shots fired (only when necessary)
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.