> I don’t know why the network would be any way special. The network isn't special. This applies locally too. But the article we are commenting on (at least, _I_ was commenting on) is about the network, and it uses the…
In many statically-typed languages, types do not exist at runtime - they are erased once the program is known to be internally consistent. What is left is not type safety, it is parsing and validation of unstructured…
My point was more that the layers below the application will also have to parse the data into a particular format - in the case of networked applications, into TCP/IP packets, then anything particular to the message…
The idea of "type safety over the network" is a fiction. When it comes down to it, what is being sent over the network is 1s and 0s. At some point, some layer (probably multiple layers) are going to have to interpret…
Turing completeness and P completeness are completely different things. There is no sense in which P-completeness is a "more specific" version of Turing-completeness.
> The $ operator is nothing but syntactic sugar that allows you to write bar $ foo data instead of having to write bar (foo data). That’s it. Actually, it's even simpler than that: the $ operator is nothing but a…
The Co-op in Sandwich, Kent is still locally known as the Pioneer!
It wasn't easier, but it was simpler. Fewer moving parts. The reason we moved away from it was that after a point, the amount of legwork to implement relatively simple behaviours became astronomical. Whether or not the…
> Understanding the map signature in Haskell is more difficult than any C construct. This is obviously false. The map type signature is significantly easier to understand than pointers, referencing and dereferencing. I…
> Just imagine Vampire Survivors without sound or effects. I can't help but feel that this completely undermines your point - Vampire Survivors is bashed together using rudimentary knockoffs of sprites from games from…
> Here are some monoids: string-append over strings, addition over integers, state transition over machine states, compose over unary functions. Correction: function composition is not a monoid over unary functions,…
> I don’t know why the network would be any way special. The network isn't special. This applies locally too. But the article we are commenting on (at least, _I_ was commenting on) is about the network, and it uses the…
In many statically-typed languages, types do not exist at runtime - they are erased once the program is known to be internally consistent. What is left is not type safety, it is parsing and validation of unstructured…
My point was more that the layers below the application will also have to parse the data into a particular format - in the case of networked applications, into TCP/IP packets, then anything particular to the message…
The idea of "type safety over the network" is a fiction. When it comes down to it, what is being sent over the network is 1s and 0s. At some point, some layer (probably multiple layers) are going to have to interpret…
Turing completeness and P completeness are completely different things. There is no sense in which P-completeness is a "more specific" version of Turing-completeness.
> The $ operator is nothing but syntactic sugar that allows you to write bar $ foo data instead of having to write bar (foo data). That’s it. Actually, it's even simpler than that: the $ operator is nothing but a…
The Co-op in Sandwich, Kent is still locally known as the Pioneer!
It wasn't easier, but it was simpler. Fewer moving parts. The reason we moved away from it was that after a point, the amount of legwork to implement relatively simple behaviours became astronomical. Whether or not the…
> Understanding the map signature in Haskell is more difficult than any C construct. This is obviously false. The map type signature is significantly easier to understand than pointers, referencing and dereferencing. I…
> Just imagine Vampire Survivors without sound or effects. I can't help but feel that this completely undermines your point - Vampire Survivors is bashed together using rudimentary knockoffs of sprites from games from…
> Here are some monoids: string-append over strings, addition over integers, state transition over machine states, compose over unary functions. Correction: function composition is not a monoid over unary functions,…