On 24 March 2010 15:46, 国平张 <[email protected]> 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 [email protected] IvanMiljenovic.wordpress.com _______________________________________________ Haskell-Cafe mailing list [email protected] http://www.haskell.org/mailman/listinfo/haskell-cafe
