533 karma · joined February 8, 2013
I don't think that's true for their VR/MR hardware. That's Meta's attempt to get a product that is _not_ like that, but which instead gets them in a position similar to where Google and Apple are for phones. I.e., where they own the platform and can profit off of that.
Is the French system a good example of a multi-party system? It currently seems to be struggling with handling three parties and it doesn't guarantee proportional representation. The presidential election is a winner-takes-all system and in the election for the Assemblée Nationale each constituency is a winner-takes-all.
const result = Promise.race(job1(), job2());As another example to your point, whether a function returns a list of foo's or a single foo is a also a color. You have to do completely different things when calling a function that returns a list compared to one that just returns a single value. And that's not just empty pedantry. Haskell let's you treat "list" as an effect (since it is a monad). Array languages like APL, J or R are colorblind with respect to "a list"/"not a list" as the difference is erased (to a large extend). So there really is a whole rainbow of function colors (basically types).
On the other hand, this point of view doesn't really invalidate the original coloring argument at all. The effect encapsulated by "async" really is one that can be annoying and one that can actually be made implicit with a result that many would prefer.
const promise1 = job1();
const promise2 = job2();
const [result1, result2] = Promise.all(promise1, promise2);Not sure if I misunderstand what you mean, but this does not require subtyping. One of the key distinguishing features of row polymorphism is that exactly this can be achieved without subtyping. The extra unused fields (`y` in your example) are represented as a polymorphic type variable _instead_ of using subtyping. See for instance page 7 in these slides: https://www.cs.cmu.edu/~aldrich/courses/819/slides/rows.pdf
> Cosmopolitan Libc makes C a build-anywhere run-anywhere language, like Java, except it doesn't need an interpreter or virtual machine.
WebAssembly would not achieve the same thing as it's in the same category as Java bytecode where you need some interpreter/VM/JIT/compiler to actually run it.
If your numbers can get out of the range of 32 or 64 bits then representing them as int32 or int64 will not solve your problems, it will just give you other problems instead ;)
If you want integers in JS/TS I think using bigint is a great option. The performance cost is completely negligible, the literal syntax is concise, and plenty of other languages (Python, etc.) have gotten away with using arbitrary precision bignums for their integers without any trouble. One could even do `type Int = bigint` to make it clear in code that the "big" part is not why the type is used.
Why would the distribution have to be symmetric? My intuition is that if you sample n numbers from some distribution (even if it's skewed) and pick a random number among the n numbers, then on average that number would be separate the number into two equal-sized sets. Are you saying that is wrong?
Source (in Danish): https://www.altinget.dk/artikel/regeringen-lander-aftale-om-...
> Identifiers have no structure, i.e., we don’t care about their internal representation. The only fundamental requirement is the ability to compare values of those types for equality. This lack of structure suggests an appropriate mathematical model for such types: a set, a collection of distinct objects.
I don't understand what this is trying to say and this "mathematical model" of sets doesn't seem to be applied further on. In math, objects are usually always assumed to have a notion of equality, so I don't see how that alone implies a set. A mathematical abstraction that matches the `Eq` trait would be a setoid.
The `LocusLike` trait is a lot like a metric space with a total order. I wonder if it can be implemented by things that are not basically numbers under the hood (not that it needs to, just curious)?
> Unlike design patterns, the universal domain types are based on mathematical abstractions and can be specified precisely.
I feel like this is over-selling it a bit. I think the ideas are great but, at least as presented here, I don't think they are rigorous enough to deserve the label "mathematical abstractions".
> UI was comparable.
They were not at all comparable. Here is an image of what Firefox looked like when Chrome was released [1]. Here is an image of what Chrome looked like at release [2]. Barring some design tweaks Chrome looks roughly like any modern browser whereas Firefox looks ancient by modern standards. It has the app menu, no integration with window decoration, a separate search box, tabs below the address bar, etc. Lots of things that Firefox would copy over the coming years. There's a reason Chrome was named after its Chrome–the UI was a huge selling point.
1: https://user-images.githubusercontent.com/25581533/141687681... 2: https://blogoscoped.com/files/google-chrome-browsing/search-...
I find the ads narrative pretty hard to believe. Back in the days, Firefox could compete with IE, which was the default in Windows, by being technically superior. It seems very likely that Firefox's users, who had gone out of their way to install Firefox, would also be very willing to go out of their way to install a new better browser even in the absence of ads.
Trying hard to avoid names (by, say, eta reduction in Haskell) is a fun excercise that rarely leads to more understandable programs.
Canonical has been shipping the kernel with ZFS for more than 7 years and so far they have not been sued by Oracle.