As far as my experience, there's little code in Python that I would like to replace with OCaml. Python stuff is research code and small services that were written hastily.
I would love to replace my Go code with OCaml. It was always kind of on the verge though. On one hand, once you use a proper type system, you cannot look at Go. On the other, Go's multicore is just so much better than Async/Lwt. In terms of programming, in terms of debuggability, surely in terms of performance too. Having proper multithreading in 5.0 suddenly makes OCaml strictly superior in my (rather biased) opinion.
> Can the EU for some reason not enforce its privacy laws on Uber if Uber keeps its data somewhere else?
Yes. Even assuming these laws still work if data is in another jurisdiction (prob. not), they become unenforceable. If someone sells your data in, say, Somalia, how could EU gather evidence and start a legal process?
Not OP but it varies wildly between companies. JS and Citadel are both top tier trading shops and they could not be more different when it come to wlb.
It's not hard to sniff out during the process though.
There was an even crazier detail to this story. While he thought he's fleecing tfl, he ended up paying more than he would have if tapping out properly.
I used to think the same but I'm not convinced anymore.
The issue is, it's really hard to come up with leakproof regulation. Companies have far more resources to look for loopholes than governmental agencies to design the law. An extreme example of this is the financial sector, where regulators have pretty much thrown in the towel. They just write vague law to be able to prosecute whatever after the fact.
BUT if we expect companies to behave ethically and act on that, then the incentives for businesses are effectively altered, and it's much harder to find loopholes in that.
There are model checkers such as nidhugg (C++), dscheck (ocaml). They take a test case and reach all possible terminal states by trying different interleavings.
Crucially, they don’t have to try all interleavings to reach all terminal states, making the enumeration quite fast.