mpartel

11 ms·

61.
by mpartel 7y ago
Fair, though I'd say 1-3 are more or less matched by Java/.NET and probably NodeJS. Not sure if you meant this, but now that I think about it, the "one process per request" model is actually legit differentiator that obv
62.
by mpartel 7y ago
In the past I sort-of agreed and even chose PHP in a few instances when the project was tiny enough that ease of deployment was a major factor. Nowadays with something like Heroku or App Engine, language has almost no impact on ease of depl
63.
by mpartel 7y ago
Having followed and at times heavily used PHP since the 4.x times, its story seems to be that of slowly (and begrudginly?) accepting modern language features like classes, exceptions, lambdas, GC, static typing, etc., sometimes getting thin
64.
by mpartel 7y ago
That is good advice that is unfortunately not widely followed in most of the apps I've seen. There's also the caveat that you should be prepared to retry transactions, but for small apps it's probably fine if you don't.
65.
by mpartel 7y ago
True, though even a single user triggering two actions quickly can cause issues if unlucky.
66.
by mpartel 7y ago
Sure, as long as the developer knows what they don't know. Race conditions usually don't fall into that category (and neither do potential UX improvements actually).
67.
by mpartel 7y ago
WebAssembly has some hope of changing how browsers are programmed, but you're probably right that JS will live on for many human generations as a legacy tech at least.
68.
by mpartel 7y ago
It can seem that way, but the consequence of not knowing them is lots of subtle race conditions. Granted, most webapps probably don't have enough users to trigger them too often, and the impact is often limited e.g. because the kinds
69.
by mpartel 7y ago
Application-level checks are prone to race conditions, especially at the default transaction isolation levels of many popular SQL databases. For example: transaction X deletes a parent row and its child rows while a concurrent transaction Y
70.
There Is No Algorithm for Truth – With Tom Scott(youtube.com)
2 points by mpartel 7y ago|0 comments
71.
by mpartel 7y ago
Try to make precise what this non-external thing is or provide evidence for its existence. Just come up with one sentence that says something about it that is neither trivial nor so fuzzy that it could mean anything and nothing. -- But be
72.
by mpartel 7y ago
I agree, we can (vaguely) imagine an AI that simulates human behaviour faithfully and lies about having qualia without actually having them, just like a really accurate physics simulator can in principle simulate physics as accurately as we
73.
by mpartel 7y ago
Well, qualia is exactly one of the things I would try to avoid. That can be useful depending on what you want to achieve in the discussion, but ignoring the qualia question altogether won't make it go away :) what are objective prop
74.
by mpartel 7y ago
I very much agree with the call for precise communication. People with a behavioralistic/materialistic/empiric view and people more interested in "the hard problem" often seem to talk past each other as long as they both
75.
by mpartel 7y ago
I wonder if this statement is mostly an attempt to get Ubuntu to reverse course. It seems unwise to pull support from the most popular distro if it could be supported with additional technical effort, such as bundling the libraries with Ste
76.
by mpartel 7y ago
A good compiler can in a large number of cases infer that it won't modify. The compiler can explore the call graph of the loop body and find out which methods might be called on the list, and then check that none of those methods write
77.
by mpartel 7y ago
I've been using the "experimental" LTS 2017.4 Linux version at work for over a year and the only platform-specific issue has been broken .NET 4.6 support, which has long since been fixed in 2018.x. Other than that, I've
78.
by mpartel 7y ago
A possible workaround: have multiple channels so that each channel only has a small number of listeners, and NOTIFY a random channel.
79.
by mpartel 7y ago
Reading the publication, I don't see that big a difference to existing purely functional languages. It almost reads like a rediscovery and refinement of the main value propositions of e.g. Haskell. That said, some of the refinements, e
80.
by mpartel 8y ago
Moreover, I think there's an 80/20-ish sweet spot. With an attitude of moderation, you can keep a brisk pace and achieve a pretty clean codebase with little extra effort. It seems best to defer architecting just long enough to see
81.
Analysis of Brexit-Centric Twitter Activity(labsblog.f-secure.com)
2 points by mpartel 8y ago|1 comments
82.
by mpartel 8y ago
My understanding is that most (many?) vegans even today accept killing when it's necessary for survival. That necessity is just extremely rare for modern humans (or it should be, in a fairer world). That said, I find the idea of game-t
83.
by mpartel 8y ago
It's mentioned in passing a couple of times, so I assume they've tried it wasn't faster for them.
84.
by mpartel 8y ago
It's easier to write correct code when you know certain state changes always entail a full reload. Extension installs are rare enough and VSCode reloads quick enough that the tradeoff seems sensible. This change introduces a new "
85.
by mpartel 8y ago
Your MEPs, politely and in your own words.
86.
by mpartel 8y ago
You get a license code that you paste into an editor with TabNine installed. The autocompletion engine sees it and completes the registration. Not sure where it gets saved ultimately.
87.
by mpartel 8y ago
I'm trying this with VSCode and C#. It's quite neat, though no doubt it'd be even better with a dynamic language. My main issue is when I type a '.', the C# extension gives me an accurate list of members, but TabNin
88.
by mpartel 8y ago
This is supremely cool! The masking stuff reminds me of how branching works (or at least used to work) on GPUs, so I wonder, could all this be made to work on a GPU too?
89.
by mpartel 8y ago
Also https://www.raptorcs.com/TALOSII/ . Pricy, but no longer impossibly so.
90.
by mpartel 8y ago
So, say I have: `characters = [A, B, ...]` and I want to maintain for each character `x` the invariant: `x.target = (first y in 'characters' where y.score > x.score)` Can Skip maintain such a self-referential invariant automati

More ›