I have a question about pattern-matching. In the Haskell-report it is not postulated, that
pattern matching has to be exhaustive. Would it be possible at all to implement an
algorithm, which checks Haskell-style patterns for exhaustiveness? What kinds of
complication can be expected? Maybe you have some pointers to other resources about
this topic.
Thank you, Steffen
_______________________________________________ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
