velis_vel

* Angelhack dude either comparing software engineers to the 'working class' or insisting that said 'working class' should be kept away from software engineers, and in either case out and out saying that both should be kept away from 'degenerates': just a man expressing his right to free speech

* People going 'what the fuck' on the internet about it: Orwellian.

In other words, freedom of speech not only means you're allowed to say whatever you want, but nobody's allowed to criticize you about it. Do I have that right?

> crowdsourced rightthink pushback

I can't tell what level of irony/sarcasm you're operating on here.

You're right about the theta thing, my mistake.

Finally, big-O notation describes arbitrary function growth, not just the runtime of some operation when applied to a list. It's used a lot in numerical analysis where you can show that some function can be approximated by, say, x - x^3/6 + x^5/120 + O(x^7).

  setMap :: (Ord a, Ord b) => (a -> b) -> Set a -> Set b

He describes monads as "a loophole" in the idea of function purity. This isn't true; monads aren't a way to 'cheat' any more than passing an accumulator through like

  factorial acc 1 = acc
  factorial acc n = factorial (acc * n) (n - 1)

He also calls values 'monads', which isn't accurate terminology at all; they're usually called monadic actions.

And a lot of people think that the reason astronauts float on the ISS is because there's no gravity there.

> Since Haskell people claim to be the only enablers of "true monads", they would of course nitpick about patterns implemented in other languages.

Yes, because monad is an actual term and calling something a monad just because it sort of looks like it if you squint doesn't make it one. You can't write return in the 'jQuery monad', because there's no way to wrap arbitrary data types, only things like DOM elements. Something like a promise is closer to a monad, because you can turn any value into a promise, but IIRC there are still issues around it that I don't remember offhand.

Really? So you know and use row types, linear logic, rank-N types, impredicative types, red-black trees, generalized algebraic data types, continuations, kind-level polymorphism, pattern matching, pi calculus, the Curry-Howard isomorphism, linear programming, dynamic programming, mBayesian inference, support vector machines, context-sensitive grammars, Feistel networks, one-time pads, vEB trees...

Like that?

Not if they use their name on the profile or use a picture of themselves for their avatar.

Even if they did, I don't think this really helps you; knowing that there exist arbitrarily many primes within N doesn't help you find primes any faster.