Revision as of 20:50, 18 October 2005 edit CryptoDerk (talk \| contribs) Extended confirmed users 10,493 edits m Reverted edits by 85.103.166.102 to last version by 201.12.101.99 ← Previous edit		Revision as of 21:44, 19 October 2005 edit undo TuukkaH (talk \| contribs) Extended confirmed users 1,558 edits →More complex examples: coherence with previous section Next edit →
Line 56: fibs = 0 : 1 : [ a+b \| a <- fibs \| b <- tail fibs ] ~~Yet~~The ~~another~~earlier factorial function, this time using a sequence of functions: ~~fact~~fac n = (foldl (.) id [\x -> x*k \| k <- [1..n]]) 1 A remarkably concise function that returns the list of [[Hamming number]]s in order:

Haskell: Difference between revisions