Re:Kotlin: A statically-typed language that compiles to JVM ...
by asdf1234 on Sunday November 10, 2013 @04:02PM
(#6708432)
As Martin points out in his response, the Scala version of map isn't restricted to returning a list so (a -> b) -> [a] -> [b] isn't directly comparable. To make a similar version in Haskell you'd have to use a language extension (MultiParamTypeClasses?) and the type signature would be significantly more complex.
It's debatable whether the complexity of the API is worth the additional functionality, but the basic version of map (Data.List.map :: (a -> b) -> [a] -> [b]) is utterly trivial in either language.
Re:Kotlin: A statically-typed language that compiles to JVM ...
by burntsushi on Sunday November 10, 2013 @05:06PM
(#6708660)
> To make a similar version in Haskell you'd have to use a language extension (MultiParamTypeClasses?) and the type signature would be significantly more complex.
Eh? No language extensions necessary.
fmap :: Functor f => (a -> b) -> f a -> f b
Perhaps I'm missing something though...
Re:Kotlin: A statically-typed language that compiles to JVM ...
by lmm on Sunday November 10, 2013 @05:19PM
(#6708714)
That can only be used with a fixed functor f; the scala version can send an (a -> b) to a (f a -> that), for any [a, b, that] combination for which a CanBuildFrom is available (this is basically a more generalized typeclass).
So yeah, if it takes several paragraphs to explain why something that can be as straightforward as this (Haskell)
(a -> b) -> [a] -> [b]
is actually not that complicated when it looks like this
def map[B, That](f: (A) ⇒ B)(implicit bf: CanBuildFrom[List[A], B, That]): That
it is clearly the stupid infidels that don't get it. This doesn't mean that Scala is a bad language in general, just that it is ridiculous to state that it isn't complex, especially compared to Lisp.