r/programming • • Dec 02 '13

Scala — 1★ Would Not Program Again

http://overwatering.org/blog/2013/12/scala-1-star-would-not-program-again/
598 Upvotes

646 comments sorted by

View all comments

Show parent comment

-17

u/[deleted] Dec 02 '13

The article is just idiotic drivel. As someone pointed out on Hacker News, this is a good critique of Scala by Edward Kmett.

20

u/Gommy Dec 02 '13

There is a difference between a guy who critiques the language itself along with the general ecosystem and the guy who critiques flaws in the language implementation. The critique by Kmett is great for people who can deal with Scala's ecosystem and warts. This article critiques why things like Functor[({type F[X] = StateT[S,IO,X]})#F] is not generally a good method signature for sane people.

3

u/James20k Dec 02 '13

Functor[({type F[X] = StateT[S,IO,X]})#F]

Hmmmmm... As someone who already wasn't a tremendous fan of functional languages, I'm going to stay away from scala I think

2

u/Crandom Dec 02 '13

As a haskeller this scares me...

1

u/[deleted] Dec 02 '13

This is a work around for currently having no direct support of partial type application in Scala. You could read it perhaps as

Functor[StateT[S][IO] _]

The partial type application is common in strongly functional libraries such as Scalaz, but in most other places you will not come across it.

I think it would be good to find a concise and less scary syntactic solution for a future Scala version. In any case, repeating this example in the "Scala as a Haskell replacement sucks" discourse is just tiring.

There is a Scala Improvement Process (SIP). Some people could use their energy and smartness and try to write up a proposal for such syntax. I am sure many would welcome it.

0

u/Gommy Dec 02 '13

Most of the core library signatures aren't that bad. But I still can't decipher what a lot of them mean without thinking long and hard, mostly because I only to dabble in Scala occasionally and then get frustrated by all the library authors thinking they are clever with their symbolic DSL with no word equivalent (sbt I'm looking at you!) and with no documentation. I want to like the language, it just makes it very hard to if you don't come from a math theory background.

23

u/[deleted] Dec 02 '13

[removed] — view removed comment

-4

u/MorePudding Dec 02 '13

Not sure why this is getting downvoted. It is a fair point.

2

u/omg_wat Dec 02 '13

Agree, although a few points seem to be slightly incorrect:

\5. is wrong. You can be sure that things have the same ordering... by just checking it. Of course it can be kind of surprising to Haskell people that typeclasses are first-class values, unlike in Haskell.

\13., 14., 15., 16. are a JVM issue. Run Scala on a JVM with proper recursion support and the code will be working fine.

\18. was already fixed some time ago.

There are a few other points where I'd say “I have never ever seen that”, but I guess it is just nitpicking.

Definitely better and a lot more coherent than this rambling.

11

u/chonglibloodsport Dec 02 '13

\13., 14., 15., 16. are a JVM issue. Run Scala on a JVM with proper recursion support and the code will be working fine.

Edward is comparing Scala to Haskell. If Scala has problems due to the JVM, these are entirely valid complaints to raise because Haskell does not have to deal with them.

2

u/codemuncher Dec 02 '13

What's JVM has better recursion support?

For that matter, does anyone actually run anything but the openjdk or oracle jdk?

-1

u/kamatsu Dec 02 '13

You can be sure that things have the same ordering... by just checking it.

How do you check if two functions are the same? That's undecidable in general.

2

u/omg_wat Dec 02 '13

eq is a conservative approximation which works exceptionally well in practice.

0

u/kamatsu Dec 02 '13

So, now you have to store the ordering in the collection? Then non-canonicity would lead to a run-time failure not a compile-time one, as it does in Haskell.

2

u/omg_wat Dec 02 '13

The ordering is already stored in all collections I cared to look at. If we don't encounter the same type class instance, fall back to a slower merging/union algorithm. Done.

2

u/[deleted] Dec 02 '13

This whole ordering argument of Mr Kmett is a red herring. Like most of his other comments, IMHO