fibonacci-0.1.0.0: Fast computation of Fibonacci numbers.

Portabilityportable
Stabilityexperimental
MaintainerSebastian Fischer (sebf@informatik.uni-kiel.de)

Data.Numbers.Fibonacci

Description

Fast computation of Fibonacci numbers.

Synopsis

Documentation

fib :: (Integral int, Num num) => int -> numSource

Computes Fibonacci numbers. We begin the Fibonacci sequence with one, not zero: 

   map fib [0..9] == [1,1,2,3,5,8,13,21,34,55]