Jeffrey A. Scofield [EMAIL PROTECTED] writes:
I'm not worried about speed per se, rather I'm trying to validate
my (rough) complexity analysis for the function and, if it works,
to make some projections for how long it would take to calculate
various things.
Since you aren't interested in
Hi,
the following toy program has a strange behaviour,
when compiling with ghc5.04.3 an no optimisation (-O0)
module Main(main) where
import System.IO.Unsafe
main = case unsafePerformIO (print test) of
() - main
ok, probably I use unsafePerformIO in an unsafe way and so on,
It's correct behaviour to print test any number of
times. Haskell is non-strict, which only means that things
aren't evaluated unless needed. It's not (defined to be)
lazy, which would mean that named expressions would be
evaluated at most once (though ghc meets this). It's also
not
whats up. I thought you might be interested in this.
not only that but you just owe it to yourself and your family,
simply put, your matched with the cheapest possible mortgage available for your loan.
---
http://r.aol.com/cgi/redir-complex?url=http://[EMAIL
