Johannes Waldmann wrote:

>i'd like to support Ralf's opinion: n+k patterns have advantages
>(when used in a certain manner) so it would be good to keep them.
>
>personal reason: right now i'm busy giving tutorials on recursive functions
>and it's really nice if you can write f(...,y+1) = ... (... y)
>instead of f(...,y) = ... (... y-1)

Why do you find this makes a significant difference? Personally, I find

    f x = ... f (x - 1)

much more intuitive than

   f (x + 1) = ... f x

I see no advantage in the n+k version.

Craig



Reply via email to