Elm code is boilerplate heavy, it's a trade off you guys have made to make the language simple. That's okay, but don't pretend like you didn't make the trade off.
Elm code is boilerplate heavy, it's a trade off you guys have made to make the language simple. That's okay, but don't pretend like you didn't make the trade off.
I just straight-up disagree with this. If Elm added Haskell-style typeclasses today, and we refactored our whole code base at work to use them, I bet it would save us less than 1% LoC.
This is such a weird thing to try to respond to. It's like a group of people started insisting that JavaScript's big problem is all the parentheses, and accusing JavaScript developers of sticking their fingers in their ears about the most obviously glaring weakness in the language.
What reasonable response can anyone make to that claim, except "I really don't think that's what the language should focus on improving?"
That's a straw man which isn't directly analogous to the question of typeclasses. The reason is because parens are a syntax concern, which is understood at this point to be largely a matter of personal preference. Typeclasses are a language semantics matter. They could add new levels of reuse for identical operations over different types, and they've done exactly that for other languages.
> What reasonable response can anyone make to that claim, except "I really don't think that's what the language should focus on improving?"
Well, the burden of proof should be on the proposer: that the feature is useful. A good next step would be for someone who's interested in persuading you of the importance of typeclasses to pick concrete examples from NoRedInk's open source Elm and show you how they could be improved, disproving your hypothesis that typeclasses wouldn't really help.
(edit: removed redundancy around "burden of proof")
I agree! That would make for a much more straightforward discussion. :)
Same for map operations, fold, etc.
Then there's other things that would benefit from further abstraction, like being able to compose apps or update functions without boilerplate.
These are just a few examples. What else do you need for it to feel like abstraction beyond simple functions is a useful feature?
`data Foo = Foo {fooA :: Text, fooB :: Text}`
then I must write a method `show :: Foo -> Text` for it. It is immaterial if I write `instance Show Foo where`
` show foo = (... implementation ...)`
or `shooFoo foo = (... implementation..)`
I save no code with typeclasses (at this point at least). (I do save code with the magic "deriving", but that's not part of the typesystem; it's just the compiler implicitly generating a bit of code for me.)Likewise, map operations, fold. They need to be written and used.
I'm sceptical of Elm's claim that typeclasses aren't useful, but your post doesn't show what it sets out to, because it lacks concreteness.
Out of your post, it is only when you get to function composition that typeclasses can theoretically help — but the question isn't, can they theoretically help, it's do the help in practice.
So can you show some example? To meet the challenge and provide convincing evidence that a language without typeclasses is lacking, you would need to say "This is what the code is. And this is what it could be with typeclasses". Unless you do that, Noredink's claim that their code wouldn't be simplified with typeclasses stands.
I do not think you are obliged to do this. It is perfectly legitimate for you to ignore my message. But I think both sides can agree that this is what would be convincing to the anti-typeclassists.
Of course you save no code on definitions. Some may even get more verbose.
You save code on usage, because you can use generic functions that will work for any instance of Show, instead of specifying them for every type.
What I'm saying is that even useful features come with both benefits and drawbacks. For example, I think user-defined typeclasses would add significant complexity to the language and especially to the library ecosystem.
I'm not saying "these are worthless ideas," I'm saying "these benefits wouldn't improve my life enough to justify the cost." :)
Perhaps you can't see the benefit and you're happy writing 10 implementations of "show", but don't claim there is no boilerplate.
For the record I don't care if it's typeclasses and I wouldn't want to see Elm turn into haskell. I'd just like some other type of mechanism for abstraction besides extracting to a function.
You seem very certain of this, so surely finding some real-world code examples to back it up should not be too difficult, yeah? :)
> Perhaps you can't see the benefit and you're happy writing 10 implementations of "show"
Like I said, I do see the benefit, but don't think it's worth the drawbacks.
Also, "deriving" saves you from writing "show" implementations, not typeclasses, so I'm not sure why you're bringing that up.
For example, Rust has typeclasses (called traits) and Rust has a lot of libraries that do the right thing for you.
fn accumulate<'a, T: Monoid>(tuples: &[(&'a str, &Fn(i32) -> bool)], i: i32) -> Option<T>
where T: From<&'a str> {
tuples.iter()
.filter(apply(second, i))
.map(first)
.cloned()
.map(<&str>::into)
.fold1(T::op)
//op just concatenates, but Cow<'a, str> does not satisfy Add
}
Here, the functions first and second are taken from tool.rs, fold1 is from itertools, the type Monoid and the function op is taken from monoid.I did have to write the delayed apply function myself, though. It's definition is:
fn apply<A, B, C, F, G>(mut f: F, a: A)
-> impl FnMut(&B) -> C // must still be `for<'r> impl FnMut(&'r B) -> C`, because that’s what filter requires
where F: FnMut(B) -> G, // must not be `for<'r> FnMut(&'r B) -> G`, because regular functions do not implement it
G: FnMut(A) -> C,
B: Copy, // for dereferencing
A: Clone {
move |b| f(*b)(a.clone()) // this must do any bridging necessary to satisfy the requirements
}
I think that could also be in a library somewhereOf course. We publish quite a few such libraries, in fact. :)
Search for "NoRedInk" on http://package.elm-lang.org
I think a more apt comparison is comparing Elm to Go missing generics. Without do-notation I imagine that elm code is filled with a lot more awkward case branching.