Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
kd0amg
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
29 ms
·
241.
▲
by
kd0amg
9y ago
If you want that kind of overkill, how about using interprocedural data-flow analysis to try to parse APL? https://dl.acm.org/citation.cfm?id=805380
242.
▲
by
kd0amg
9y ago
However, I found the programs being discussed in the J discussion lists completely impenetrable. I would argue that (a big) part of the issue is that proponents often overstate the readability of such code. My usual experience from the J
243.
▲
by
kd0amg
9y ago
On the other hand, they've probably had a lot more early exposure to the idea that one is better off changing jobs every few years. After having three jobs in ten years instead of one, they're much less likely to be stuck with a n
244.
▲
by
kd0amg
9y ago
Easier than in other fields, yes, but also definitely not so easy that anyone who makes a serious attempt will manage it.
245.
▲
by
kd0amg
9y ago
There is less of an oversupply because it's easier for CS PhDs to just go to industry (possibly in a non-research position) than it is in a lot of other fields, but I think it's still unrealistic to expect every CS PhD who seeks a
246.
▲
by
kd0amg
9y ago
they are not going to mea culpa and send me the refund too Isn't that exactly the author's point? In that scenario, the IRS has taken harmful action against you to make up a cost they incurred by falling for someone else's
247.
▲
by
kd0amg
9y ago
20% more expressiveness … reduce that million line code base down to 833k lines I'm not convinced language expressiveness can really be quantified that way. emphasis on reducing constant overhead at the expense of adding more linear
248.
▲
by
kd0amg
9y ago
What do you think programming languages are standing upon if not math? Many do, especially in academia, but quite a few seem to be standing on a combination of "this looks like it'll do what I want" and "this interpret
249.
▲
by
kd0amg
9y ago
HCI's methods in particular are too expensive to test the conjectures we normally offer about our designs though. A sizeable team of experienced programmers designing, building, or maintaining a significant software product can't
250.
▲
by
kd0amg
9y ago
unless the judge allows them to move it out of small claims court How common is this?
251.
▲
by
kd0amg
9y ago
What does this prove though? That no specific real is guaranteed to be left out of every list? Was that ever in dispute?
252.
▲
by
kd0amg
9y ago
wouldn't the compiler theory be one of the most greatly affected research fields? Why would it? What techniques do you propose to use for what tasks?
253.
▲
by
kd0amg
9y ago
You could do a fairly straightforward conversion but it would be terribly slow for many things. Is there a non-straightforward conversion that isn't? It seems to me like any SoA->AoS transformation is going to have pretty much the
254.
▲
by
kd0amg
9y ago
Is it possible to automatically convert an AoS-based algorithm to SoA? Does this require anything more than transposing some struct member accesses? IIRC, Futhark already does that kind of conversion.
255.
▲
by
kd0amg
9y ago
Getting back to this particular case, there's something to be said for the idea of learning C before trying to replace C. C certainly isn't a flawless language, but now it's hard to have much faith that OP knows it well enoug
256.
▲
by
kd0amg
9y ago
The fun is more what we build, not with what. Pain can definitely come from what you use to build though.
257.
▲
by
kd0amg
9y ago
Look at the ingredients in most box pasta sold in the US Do you have an example? All I have on hand says 1 gram of sugar per 2oz of dry pasta, with no sugar or corn syrup in the ingredients list.
258.
▲
by
kd0amg
9y ago
Is it really that common for a court to have no (or only a few) "easy" cases pending?
259.
▲
by
kd0amg
9y ago
You know if it will be right or wrong before you even turn it in. Most student-written test suites I've seen are not nearly this thorough.
260.
▲
by
kd0amg
10y ago
Reminds me of this chart: https://www.youtube.com/watch?v=PI99A08Y83E&t=13m45s (if you want to skip to the punch line, it's just after 15:00), but this one is still in log scale.
261.
▲
by
kd0amg
10y ago
* However I wonder what's left after you remove the issues I mentioned above. There are two cases: typed language and untyped language. In the first case you're left with Type Theory. In the second case you're left with, eith
262.
▲
by
kd0amg
10y ago
Perhaps GP believes he does not have the skills to identify market inefficiencies, or believes he does not have the skills to identify fund managers who have the skills to identify market inefficiencies. Those would seem to rule out picking
263.
▲
by
kd0amg
10y ago
The analysis to recognize whether a "canned procedure" is applicable is nontrivial, to put it lightly.
264.
▲
by
kd0amg
10y ago
I worry that these will be citations (and publications) that "don't really count" in heavily career-impacting decisions. Just getting citations to appear won't make funding agencies, tenure committees, etc. value distill
265.
▲
by
kd0amg
10y ago
"You should go collect my data for me" is something you tell your lab tech, not your unconvinced interlocutor.
266.
▲
by
kd0amg
10y ago
What steps did you have in mind? It's been some time since I last made an IPA, but I don't remember it involving any more post-fermentation work than anything else I've made.
267.
▲
by
kd0amg
10y ago
How about Thirteenth Hour?
268.
▲
by
kd0amg
10y ago
I've generally found, both with my own code and others' code, that `some-undocumented-special-form' is about as understandable as `some-undocumented-function' (and a similar equivalence for things that are documented).
269.
▲
by
kd0amg
10y ago
RoR doesn't look particularly web-focused to me (the end of it mentions the web server as something worth reading about). That said, it leaves a lot of Racket's features untouched. HtDP doesn't really aim for SICP's nich
270.
▲
by
kd0amg
10y ago
Whether these restricted languages are doable as embedded DSLs in general-purpose language remains to be seen. There have been attempts that work pretty well (Accelerate for Haskell is the one I know best), but they are limited in expressi
More ›