Why do programs written in Haskell not have side effects?
To have side effects someone would have to run the programs.
Haskellers when someone boasts about Typescript’s fake type system.
I started programming in a time when the idea that the computer could keep track of your variable types for you automatically was a fever dream, so it’s wild for me to see some programmers now throwing shade at particular langages for “not implementing proper variable typing functionality”.
It feels like someone saying that low-fat milk producers are too cheap or lazy to put enough fat in their milk.
Fashion really does go in cycles.
I don’t even think it’s fashion. Some ideas sound good but are bad. Or, overlappingly, are convenient to use but actually turn into nightmarish spaghetti code. I don’t know how many people are still pushing MongoDB and BASE, for example.
Meanwhile SQL hasn’t changed, and C didn’t until someone figured out memory safety in Rust.
1950??? Statically typed programming languages are very old…
Sorry for not being clear; when I said “keep track automatically” I meant dynamic typing. Of course you’re right that “keeping track of your variables” could also be interpreted to refer to static typing.
The same reaction whenever I look at haskell. A “pure” language with an escape hatch that has a fancy name. Once you open the escape hatch, you can write entirely impure code in Haskell and never see a pure function in your life. So much for “pure”.
You say your house is clean, yet nothing’s stopping me from dumping out this bucket of mud on your floor, curious!
Reading current discussion, it seems more like “You say that it’s impossible to dirty your house, yet nothing’s stopping anyone from dumping out this bucket of mud on your floor, curious!”
Same goes for rust and memory safety. What’s your point?
Count us rust folks in. Typescript may doing it’s best, but it’s not as great
Are extensible records usable already?
Not that I would pick TS because of that, but the disdain is undeserved when it has some very useful features that Haskell has been trying to copy for years.
The features Haskell has been “trying to copy” from TypeScript are, without exception, features TypeScript copied from type theory research that predates TypeScript by decades – row polymorphism from Didier Rémy’s 1989 work, untagged unions from the intersection type literature of the 1980s, type-level computation from Martin-Löf’s 1975 intuitionistic type theory – and what you are observing is not Haskell enviously watching TypeScript and taking notes, but rather two languages drinking from the same well of ideas, one of which is doing so with a formal semantics and a proof of soundness, and the other of which is doing so while standing in a JavaScript runtime and hoping no one looks down.
Elm for ever!
