gerasimovd's blog

Does anyone use Haskell?
By gerasimovd, 14 years ago, In English
I want to learn a functional programming language, so I chose Haskell. But I don't know how can I use functional programming features for problem solving. So, could you name some Haskell programmers, I would have watched their code after the contest and learn Haskell? 
if I have mistakes in my English, please, tell me :)
  • Vote: I like it
  • +6
  • Vote: I do not like it

Comments Comments (10)
| Write comment?
»
11 years ago, # |
  Vote: I like it +8 Vote: I do not like it

So, anything? anyone constantly writing in haskell?

→ Reply
»
11 years ago, # |
  Vote: I like it +5 Vote: I do not like it

You can go to the status page of any contest, and filter submissions by programming language choosing haskell ... You will find few submissions and mostly in Div.2

→ Reply
  • »
    »
    11 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    But isn't better(/faster) to have someone in my standing? : ))

    → Reply
  • »
    »
    11 years ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Darooha (try google his real name) using Ocaml. It's an interesting fact itself I think) But it also related to topic)

    → Reply
    • »
      »
      »
      11 years ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      There is a wikipedia page about him? O-o

      → Reply
      • »
        »
        »
        »
        11 years ago, # ^ |
          Vote: I like it +6 Vote: I do not like it

        He was one of the pioneers in amortized analysis of algorithms, early examples of which were the analyses of the move-to-front heuristic, and splay trees. He invented many data structures with Robert Tarjan, such as splay trees, link/cut trees, and skew heaps. Yes, I have nothing to say except Oo)))

        → Reply
    • »
      »
      »
      11 years ago, # ^ |
      ← Rev. 4   Vote: I like it +3 Vote: I do not like it

      OCaml is strict and multi-paradigm, while Haskell is non-strict, purely functional and completely referentially transparent, basically forcing you to think in functors, monads etc. I would say the two are not really comparable (and it's definitely easier to write fast code in OCaml, so it's nice for contests).

      → Reply
»
11 years ago, # |
← Rev. 5   Vote: I like it +25 Vote: I do not like it

I work for a company that uses Haskell in production. So I code a lot of "real-world" Haskell code. It's a very beautiful language, unmatched in its elegance and contrary to popular belief very capable of solving real-world problems. However I don't use it for contests because it's slightly harder to get it to run really fast than it is to get C++ code to run really fast. I guess it's a bit like Java in that regard. Another problem is that if Haskell is supported at all, most of the GHC versions used on contest platforms are outdated by years (Codeforces is an exception).

If you have any questions, you can ask me or the Stack Overflow Haskell tag, which is very active.

EDIT: I just saw the original post is 3 years old... But maybe somebody else finds this interesting

→ Reply
»
11 years ago, # |
  Vote: I like it +6 Vote: I do not like it

I can advise code of watashi. He writes contests on an incredible number of languages​​!

For example Codeforces submission 3652300.

Please, look at his repo in Github. Each problem is solved in different languages​​! It's awesome! :)

→ Reply