In article <[EMAIL PROTECTED]> [EMAIL PROTECTED]
writes:
>
>Yes --- How DOES one explain the interaction of irrefutable patterns
>and laziness to beginners. I wouldn't go so far as to say, as Joe does,
>that I hate ^patterns, but their use is sometimes obscure and not
>obvious in the way that the equations of functional programming are
>meant to be.
>
Having just learnt about the use of irrefutable patterns for I/O, I
wish my suspicions about them being a bolted on addition to the
language for pragmatic reasons to be dispelled. Do irrefutable
patterns cause any problems mathematically? Does the ability to reason
(relatively) easily about functional programs disappear when they are
used?
Rob
--
--
Rob Turner, Dept. of Computer Science, University of Hull, UK.
Internet: [EMAIL PROTECTED] Phone: (0482) 465212
