4 ms·

Competitive Programming in Haskell...I can only define this as Masochistic Aesthetics...

• javcasas 2y ago
  Uncommon solulutions are done better with uncommon tools.
  • belter 2y ago
    Competitive programming demands tight control over execution time and memory attributes best served by languages that offer strict evaluation and low-level data manipulation. Haskell has lazy evaluation, what can lead to unpredictable performance and space leaks. Monads are abstraction layers...
    • javcasas 2y ago
      > Monads are abstraction layers... So is everything. BTW, read the article. No monads in there, unless you believe monoids are monads.
      • belter 2y ago
        My argument is about the practical trade-offs in competitive programming and Haskell being the wrong vehicle for it.
        • javcasas 2y ago
          Well, it depends on how you measure competitive programming. I think for measuring it in O() terms - as every paper out there on data structure does -, Haskell is quite good for the task.
• tikhonj 2y ago
  Counterpoint: competitions are games, games are about fun, Haskell is fun.
• itishappy 2y ago
  Maybe. Anybody have a monoidally annotated queue in C++ to compare?
  • GistNoesis 2y ago
    See my above comment https://news.ycombinator.com/item?id=43161105 https://news.ycombinator.com/item?id=43161105
    • itishappy 2y ago
      Nice, thanks!