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

[国平张]

Hi,

I wrote a type program to compute fibonacci series, if the max value
is big, then it becomes very slow.
like

take 100 fib

How can I make it faster :-)

>>>>>>>>>>>>>>>>
fibo 0 = 0
fibo 1 = 1
fibo (n+2) = (fibo n) + (fibo (n+1))
fib :: [Int]
fib = [fibo i | i <- [0..]]