The following behaviour of infinite recursion seems exaggerated: script test.hs contains only
undef :: Int->Int undef x = undef x + 1 >:l test >:t undef undef:: Int->Int >undef 1 Segmentation fault Shouldn't this rather run into an infinite loop or a memory overflow. But segmentation fault? Best, Bernhard _______________________________________________ Hugs-Bugs mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/hugs-bugs
