<table cellspacing="0" cellpadding="0" border="0" ><tr><td valign="top" style="font: inherit;">Hi all,<br><br>A lot of things posted here I wasn't aware of. My original example involved ~(x,y), so, returning to that context, how would these two simple cases vary:<br><br>add2 :: (Int,Int) -> Int<br>add2 (x,y) = x+y<br><br>add2 :: (Int,Int) -> Int<br>add2 ~(x,y) = x+y<br><br>I guess what I'm looking for is the concept that would dictate choosing one over the other.<br><br>Thanks,<br><br>Michael<br><br><br><br>--- On <b>Mon, 11/30/09, Daniel Fischer <i><daniel.is.fischer@web.de></i></b> wrote:<br><blockquote style="border-left: 2px solid rgb(16, 16, 255); margin-left: 5px; padding-left: 5px;"><br>From: Daniel Fischer <daniel.is.fischer@web.de><br>Subject: Re: [Haskell-cafe] Mystery operator?<br>To: haskell-cafe@haskell.org<br>Date: Monday, November 30, 2009, 1:35 PM<br><br><div class="plainMail">Am Montag 30 November 2009 19:32:01 schrieb
Brandon S. Allbery KF8NH:<br>> On Nov 30, 2009, at 13:26 , michael rice wrote:<br>> > So, ALL patterns are strict, unless one precedes them with "~"?<br>><br>> "case" patterns are strict (this includes pattern matching in function<br>> arguments).<br>> "let" patterns are lazy.<br><br>And of course, wildcard patterns (_) and variable patterns (var) are lazy too.<br>_______________________________________________<br>Haskell-Cafe mailing list<br><a ymailto="mailto:Haskell-Cafe@haskell.org" href="/mc/compose?to=Haskell-Cafe@haskell.org">Haskell-Cafe@haskell.org</a><br><a href="http://www.haskell.org/mailman/listinfo/haskell-cafe" target="_blank">http://www.haskell.org/mailman/listinfo/haskell-cafe</a><br></div></blockquote></td></tr></table><br>