(1 + (foldr
plus
0
[2
3
4
5]))
and a beginner might have serious problems to
understand what really happens in a true Haskell
program.
3. The system accepts typing abominations, say, (foldl plus [] [1
2
3
4 5]) and joyfully
develops the structure, which cannot be finally
reduced.
4. I don't understand
the relation between the typing and
the behaviour.
I tested foldl with my own function put into the
function editor: const x y = x without type
declaration.
The expression is expanded, but never reduced,
const remains in the final expression. When
const type is declared, it is reduced.
5. I tried to define my own recursive function
(a factorial) and test it replacing one of the
standard examples. This breaks the system. If it
is not allowed, please say so explicitly. If I
did something silly, please see my point (1).
My best regards, and thank you once more.
Jerzy Karczmarczuk
Caen, France