On Mon, Jun 23, 2008 at 5:58 AM, Luke Palmer [EMAIL PROTECTED] wrote:
On Mon, Jun 23, 2008 at 3:26 AM, Xiao-Yong Jin [EMAIL PROTECTED] wrote:
Hi all,
I'm writing a short function as follows, but I'm not able to
find a suitable type signature for `go'. It uses
Numeric.LinearAlgebra from
To answer the question in the subject:
From Simple unification-based type inference for GADTs,
Peyton-Jones, et al. ICFP 2006.
http://research.microsoft.com/users/simonpj/papers/gadt/
Instead of user-specified type, we use the briefer term rigid
type to describe a type that is completely
Luke Palmer [EMAIL PROTECTED] writes:
On Mon, Jun 23, 2008 at 5:58 AM, Luke Palmer [EMAIL PROTECTED] wrote:
On Mon, Jun 23, 2008 at 3:26 AM, Xiao-Yong Jin [EMAIL PROTECTED] wrote:
Hi all,
I'm writing a short function as follows, but I'm not able to
find a suitable type signature for `go'.
On Mon, 23 Jun 2008, Xiao-Yong Jin wrote:
Thanks for the explanation. I guess it's just easier for me
not to give any type signature to `go', since ghc should do
the type inference quite nicely and reliably.
If you want to stay Haskell98 'asTypeOf' can help you in similar cases.
Hi all,
I'm writing a short function as follows, but I'm not able to
find a suitable type signature for `go'. It uses
Numeric.LinearAlgebra from hmatrix.
-- | Map each element in a vector to vectors and thus form a matrix
-- | row by row
mapVecToMat :: (Element a, Element b) =
On Mon, Jun 23, 2008 at 3:26 AM, Xiao-Yong Jin [EMAIL PROTECTED] wrote:
Hi all,
I'm writing a short function as follows, but I'm not able to
find a suitable type signature for `go'. It uses
Numeric.LinearAlgebra from hmatrix.
-- | Map each element in a vector to vectors and thus form a
