Timeline for Is Haskell's type system an obstacle to understanding functional programming?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 15, 2011 at 2:05 | comment | added | Theo Belaire | Well, some parts are messy, I agree. I really think that the numeric stuff in the prelude could stand to be cleaned up and fixed, because as it stands, it's a terrible mess. But most of the key functional aspects are pretty clean. map, filter, foldr/l, and other fun functional functions work quite nicely. | |
| Nov 15, 2011 at 2:00 | history | edited | Theo Belaire | CC BY-SA 3.0 | Added more words |
| Nov 13, 2011 at 21:28 | comment | added | Andres F. | Tyr, even with type inference, 90% of using and coding Haskell functions is getting the damned things to mesh with each other, which requires an understanding of its type system and arcane typechecking error messages. Even ":t" is not a magical solution, just the first step to understanding how to make the program compile. | |
| Dec 22, 2010 at 14:41 | comment | added | Theo Belaire | Not ignore so much as ignore it as much as type out the function, load it in GHCi, and go :t on it. But you are still going to need to sprinkle in some fromIntegral or other functions in sometimes. | |
| Dec 22, 2010 at 11:33 | comment | added | Eric Wilson | If you think you can ignore Haskell's type system, then I think you haven't coded much Haskell. | |
| Dec 22, 2010 at 5:38 | history | answered | Theo Belaire | CC BY-SA 2.5 |