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

using iterate

fibonaci = map fst (iterate f (0,1)) where f (x,y) = (y,x+y)

using

take 10 fibonaci

[0,1,1,2,3,5,8,13,21,34,55,89,144,233,377]