Talk:Fibonacci sequence: Difference between revisions

Content added Content deleted
Line 209: 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).
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 on on helper functions like '''go''' and '''next''', or are expressed in terms of zipWith, which is also implemented as a recursive function.
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 on helper functions like '''go''' and '''next''', or are expressed in terms of zipWith, which is also implemented as a recursive function.


Perhaps 'iteration' is not quite the clearest or best fitting term to use here ?
Perhaps 'iteration' is not quite the clearest or best fitting term to use here ?