2 ms·

And with anonymous functions, your traceback often hasn't a clue where the function was defined.

• KirinDave 9y ago
  That's untrue. That's usually the least interesting part of the stack trace, but the easiest to compute. But your complaint isn't without merit here, a profusion of unique nameless verbs can get overbearing sometimes. It's often better than the alternatives (e.g., dependency injection vs lambdas in an environment) but Haskell, ocaml and lisps all seek to have a small but very robust set of combiner and base primitives to help make this kind of code avoid a complexity explosion similar to OO ontology explosions.