February 8, 2012

Haskell Weekly News: Issue 214

Welcome to issue 214 the HWN, a newsletter covering stories, questions, and remarks seen around the web during the week of January 29 to February 4, 2012.

Quotes of the Week

  • Jafet: [on memoising an O(n) algorithm:] This is like trying to save work in a police investigation by having each detective determine whether another detective has already removed all evidence from his area by walking through it to search for evidence in the area.
  • CodeWeaver: keep in mind encryption's only as good as how much you trust that the implementors got it right.
  • cmccann: length [1..10^20]
    lambdabot: mueval-core: Time limit exceeded
    cmccann: looks like 10^20 is infinity
  • elliott: race condition waiting to happen
  • elliott: o'reilly publishes attoparsec tutorial: exactly the same as their parsec tutorial, but 10^-18th the size
  • rwbarton: Num works for Float/Double, it's Float/Double that doesn't work for Num
  • ddarius: Space isn't that big.
  • Brent Yorgey:
    > Sometimes, I suspect that Haskell not only makes easier of the hard things for
    > imperative programming languages but also makes harder of some easy
    > things.
    This is true.  But usually these are things that you don't *want* to
    be easy, like shooting yourself in the kidney. (But these features are
    often described in ways that make them sound great, like "flexible
    usage of bullet-placement tools".)  Inserting arbitrary print
    statements into the middle of some code is difficult for a reason.

Top Reddit Stories

Top StackOverflow Questions

Until next time,
Daniel Santa Cruz

No comments: