On Thu, Jun 22, 2006 at 09:22:34AM +0100, Simon Peyton-Jones wrote: > To: Brian Hulley <[EMAIL PROTECTED]>, Joel Reymont <[EMAIL PROTECTED]> > Cc: haskell-cafe@haskell.org > From: Simon Peyton-Jones <[EMAIL PROTECTED]> > Date: Thu, 22 Jun 2006 09:22:34 +0100 > Subject: RE: [Haskell-cafe] Re: Functional programming for processing > oflargeraster images > > http://haskell.galois.com/cgi-bin/haskell-prime/trac.cgi/wiki/BangPatterns > > Bang patterns make it much more convenient to write a strict function. > E.g > f (x, !y) = ... > is strict both in the pair (of course) but also in the second component > of the pair, y.
i am ecstatic to hear that :). if it really means that 'y' will be fully evaluated (not top level normal form, but whatsthenameforthis, in the way ocaml evaluates expressions), it's something i have been missing so much that i was thinking of switching back to a strict language again. will upgrade as soon as i can, thanks! m.
signature.asc
Description: Digital signature
_______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
