stevedonovan/gentle-intro

"Languages like Haskell"

BartMassey opened this issue · 4 comments

In 1-basics: "languages like Haskell have such powerful type inference that there are hardly any explicit type names". Probably something more like "languages like Haskell have such powerful type inference that almost no explicit types are required"?

what's the difference

Haskell programs are normally full of explicit type names, whether needed or not. The type inference is used in practice almost exactly like it is in Rust.

Oh, I see... I understood the text as if "required" was present.

Good point - I like your re-wording.