[Haskell-cafe] ICFP contest write-up

2009-07-20 Thread Rafael Gustavo da Cunha Pereira Pinto
For all Portuguese reading haskellers, I am describing my ICFP 2009 contest write-up on my blog. Feel free to comment. http://rafaelgcpp.blogspot.com/search/label/ICFP2009 For the non-Portuguese readers, Google translation tools do a lousy job, but it is still readable. Regards Rafael Gustavo

Re: [Haskell-cafe] ICFP contest

2009-06-24 Thread Max Rabkin
I'm part of a fairly large team. I'm the only person on the team who's done more than Project Euler problems in Haskell, so we'll probably only use Haskell if there's a library or program that does exactly what we need for some task. Likely we'll be using Perl and Python, and C++ if there's any

Re: [Haskell-cafe] ICFP contest

2009-06-24 Thread Rafael Gustavo da Cunha Pereira Pinto
Last year I teamed up with a guy at work who had no knowledge of any functional programming language whatsoever. Actually, his main dialect is C++. We ended up trying to use plain C++, but it took us almost 6 hours to put network and string decoding routines to work. I gave up mainly because in

[Haskell-cafe] ICFP contest

2009-06-23 Thread Rafael Gustavo da Cunha Pereira Pinto
Hi, The good folks here are really quiet about the ICFP Contest. Is anyone participating this year? As in the previous four years, I will probably download the problem, take a look, and try for a while... Having a family don't allow me to go much further, especially when teaming up with myself!

Re: [Haskell-cafe] ICFP contest

2009-06-23 Thread Miguel Mitrofanov
Well, I can make a bit more concrete prediction. I'll download the problem, take a look, try for a while, discover, that it's too hard to be cracked at once, and lose interest. That sounds like a reason why I'm not participating. On 23 Jun 2009, at 22:49, Rafael Gustavo da Cunha Pereira

AW: [Haskell-cafe] ICFP contest

2009-06-23 Thread Nicu Ionita
: Dienstag, 23. Juni 2009 21:27 An: Rafael Gustavo da Cunha Pereira Pinto Cc: Haskell Café Betreff: Re: [Haskell-cafe] ICFP contest Well, I can make a bit more concrete prediction. I'll download the problem, take a look, try for a while, discover, that it's too hard to be cracked at once