#935: Minor documentation bug, odd defn of fibn.
------------------------------+---------------------------------------------
Reporter: tmcooper | Owner:
Type: bug | Status: reopened
Priority: normal | Milestone:
Component: Documentation | Version: 6.6
Severity: minor | Resolution:
Keywords: | Difficulty: Easy (1 hr)
Architecture: Multiple | Os: Multiple
------------------------------+---------------------------------------------
Changes (by [EMAIL PROTECTED]):
* resolution: fixed =>
* status: closed => reopened
Comment:
Actually, the page was correct previously. The standard benchmarking
function 'nfib', called indeed "notorious" in the nofib suite, is
{{{
nfib n = if n <= 1 then 1 else nfib (n-1) + nfib (n-2) + 1
}}}
It does not compute the Fibonacci numbers! It computes the number of
reductions required in a program that would compute the fibonacci
numbers. Subtle difference. But this is the standard historical
benchmark.
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/935>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler_______________________________________________
Glasgow-haskell-bugs mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs
