Sometimes it takes a while, but we get there eventually...
Graeme Moss [EMAIL PROTECTED] writes:
(Usual apologies if this has been noted/solved since 2.05.)
The following program (which sums [1..n] by brute force):
import System(getArgs)
data Test = Test !Int
f :: Test - Int -
Before 2.06, the definition of `seq' was
seq x y = y
i.e., not terribly useful :)
--Sigbjorn
Graeme Moss writes:
(Usual apologies if this has been noted/solved since 2.05.)
The following program (which sums [1..n] by brute force):
import System(getArgs)
data Test = Test !Int
(Usual apologies if this has been noted/solved since 2.05.)
The following program (which sums [1..n] by brute force):
import System(getArgs)
data Test = Test !Int
f :: Test - Int - Test
f (Test n) i = Test (n+i)
g :: Test - Int
g (Test n) = n
sfoldl :: Eval a = (a - b - a) - a - [b] - a
