Generating Fibonacci numbers in Haskell?

Question

In Haskell, how can I generate Fibonacci numbers based on the property that the nth Fibonacci number is equal to the (n-2)th Fibonacci number plus the (n-1)th Fibonacci numb

Answer 1

There are a number of different Haskell algorithms for the Fibonacci sequence here. The "naive" implementation looks like what you're after.