t; num1 n = countOne (take n (seq1 1))
> num2 n = countOne (take n (seq2 1))
num1 needs lots of heap space, num2 needs very few. Why?
(I checked it using ghc and '+RTS -s')
Martin Stein
ust be an instance of DBConnection. But why should
the compiler deduce that test has type OracleConnection, though there's only
this instance of DBConnection.
Usually one declares several instances, so I'm sure there is no need for an
extra rule!
test must be typed explicitly.
Martin Stein
ms to leave the data
constructor of a newtype decl out, otherwise it could be solution?
Martin Stein
one could avoid multiparamter classes at all. The two types key and dat
should be inferred by the type of dict (which is expressed by 'dict key dat'). I
can't think about a dictionary where key or dat are not associated with dict.
Martin Stein
e inferred from the
functions toList and fromList defined in an instance of Aggregate.
To keep the class as general as possible, one can't describe such dependence.
I thing multi-parameter type classes would do it, but they aren't allowed in
Haskell. So what should one do?
Martin Stein
