Strict tuples

Taral taralx at gmail.com
Wed Mar 22 23:27:20 EST 2006


On 3/22/06, Manuel M T Chakravarty <chak at cse.unsw.edu.au> wrote:
> It does happen...sometimes!  The trouble is that for certain types of
> programs (eg, numeric intensive ones), you absolutely need that
> optimisation to happen.  Without strict tuples, this means, you have to
> dump the intermediate code of the compiler and inspect it by hand to see
> whether the optimisation happens.  If not, you have to tweak the source
> to nudge the compiler into recognising that it can optimise.  Of course,
> all your efforts may be wasted when the next version of the compiler is
> released or when you have to change your code.

That kind of tweaking isn't required to simulate this. "a `seq` b
`seq` (a, b)" is perfectly sufficient, and is quite commonly seen in
such programs.

--
Taral <taralx at gmail.com>
"You can't prove anything."
    -- Gödel's Incompetence Theorem


More information about the Haskell-prime mailing list