John Meacham wrote (snipped): > recursive top level declarations are no more tricky than are normal > recursive lets.
Perhaps I am missing something, but surely one very important problem with <- at top level is that calling for the value of something defined by <- causes the corresponding action to be performed? Unless the actions available are very tightly restricted, this means that for example the meaning of a program depends on what order arguments to a pure functions are evaluated, for example. _______________________________________________ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell