19 Jul
2014
19 Jul
'14
4:49 a.m.
Am 19.07.2014 10:45, schrieb David Feuer:
I don't really see how recursing into some other inits function would help. The same laziness requirement should hold everywhere:
take (n+1) $ inits ([1 .. n] ++ undefined) = inits [1 .. n]
Maybe I don't understand what you mean properly.
I wrote my own initsDL (with different name) and in the recursive call did not call initsDL but accidentally initsR (with different name), thus initsDL became essentially initsR except for the first recursion step.