Comments on snippet: 'Fibonacci List One-Liner in Haskell' Snipplr comments feed https://snipplr.com/ Sat, 04 Apr 2026 01:31:59 +0000 deepsoul said on 11/Jul/2011 https://snipplr.com/view/54657/fibonacci-list-oneliner-in-haskell <p>You did not mention the most remarkable thing about this: It avoids computing each element many times, as a naive recursive implementation would. This is because Haskell memoizes (caches) constant definitions.</p> Mon, 11 Jul 2011 06:15:35 UTC https://snipplr.com/view/54657/fibonacci-list-oneliner-in-haskell