Talk:Fibonacci sequence: Difference between revisions
→Possibly misleading use of 'iterative' in Haskell subsection ?
Line 209:
Folds are implemented recursively (either directly or indirectly) in the Prelude, and are generally understood as 'recursion schemes' in the sense of Meier et al. (See, for example, http://blog.sumtypeofway.com/an-introduction-to-recursion-schemes/ and the much-read paper which it references).
I also notice that other examples which have ended up in the 'Iteration' section might risk compounding a reader's confusion – they are either implemented by direct and immediate recursion
Perhaps 'iteration' is not quite the clearest or best fitting term to use here ?
| |||