[Haskell-cafe] Using Get monad to efficiently parse byte-stuffed data

[Ivan Miljenovic]

On 24 March 2010 15:46, 国平张 <zhangguoping at gmail.com> wrote:
> I wrote a type program to compute fibonacci series, if the max value
> is big, then it becomes very slow.

What does this have to do with Pom's problem?

http://tinyurl.com/ya3vvye


-- 
Ivan Lazar Miljenovic
Ivan.Miljenovic at gmail.com
IvanMiljenovic.wordpress.com