Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
skew
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
8 ms
·
31.
▲
by
skew
15y ago
If there's a law that says you can call in the police to drag people away if they don't shut up when you tell them to, it certainly is an issue of freedom of speech.
32.
▲
by
skew
15y ago
Perhaps you should judge replies by the standard of civil disagreement set by the essay itself. The first paragraph of the essay says anyone who disagrees that copyright is a natural right "can go fuck themselves".
33.
▲
by
skew
15y ago
... and benchmarks that compare linked lists to ontiguous vectors
34.
▲
by
skew
15y ago
All the clojure examples test linked lists! The first example lets lazy evaluation of the random numbers leak into the timing, toss a (dorun tmp) before the timing for a little more sense. The type annotation ^doubles is useless - it's tell
35.
▲
by
skew
15y ago
It's not programming, but lhs2TeX is a positive example of typesetting code with proportional fonts. http://people.cs.uu.nl/andres/lhs2tex/ It goes to heroic lengths (writing polytable.sty) to preserve alignment in the input program, not
36.
▲
by
skew
15y ago
Apples and oranges. Can you explain implicit continuation representation in a paragraph? The simple description of lazy evaluation is graph reduction. ML doesn't even use lazy evalution.
37.
▲
by
skew
15y ago
This looks like a row of a DFT, but using the history variables and the single cosine to avoid computing the coefficients from scratch.
38.
▲
by
skew
15y ago
I enjoyed being a passenger for some "guardrail driving" http://www.eurail.com/planning/trains-and-ferries/high-speed... These too run on rails.
39.
▲
by
skew
15y ago
And false advertising is just as illegal as trespassing, but that doesn't mean we should conflate them. What's abusive is the punishment. Would it be abusive if a first offense of jaywalking was given a warning and the second punished by pe
40.
▲
by
skew
15y ago
The kind of problem where merging a commit silently overwrites a completely unrelated file with an older versions? It was a clear case of git violating a promise of safety made in the documentation, and a nice study of tracking down the bug
41.
▲
by
skew
15y ago
It is a result of the paper that once you control for lines of code, Cylomatic Complexity no longer predicts defect rate.
42.
▲
by
skew
15y ago
> The thesis referenced above argues (and provides examples) that you cannot overcome important problems by separating transformations. You need to combine them. The transformations need to be applied together, but they can be specified
43.
▲
by
skew
15y ago
I'm not sure what that speed hit is supposed to be for. If it's about time taken on the synchronization operations themselves, I haven't found the benchmarks but I seem to recall STM being reasonably competitive (maybe 10%-50% slowdown) wit
44.
▲
by
skew
15y ago
I can't explain vitriol, but when I took a brief look at scala it seemed to have unnecessary complexity from a bunch of ad-hoc rules to simplify some specific case. Little things, mostly syntax, like the conditions for leaving out parenthes
45.
▲
by
skew
15y ago
The bit about nuclear power plants is such nonsense I doubt the creditability of the rest of the article. The highest figure anywhere seems to be about 15 years, from Storm van Leeuwen http://www.stormsmith.nl/report20071013/partC.pdf
46.
▲
by
skew
15y ago
You can see the statement here: http://compcert.inria.fr/doc/html/Compiler.html#transf_c_pro... A C compiler doesn't have to promise much of anything about the behavior of the code produced for a program with undefined behavior. This stat
47.
▲
by
skew
15y ago
One thing I missed the first time reading the paper is that those were the only bugs they could find in the compiler. After reporting them and getting fixes, several CPU-years more of random programs haven turned up another failure. All the
48.
▲
by
skew
15y ago
How about papers? Almost everything has been written up. This is the introduction to the multicore runtime: http://research.microsoft.com/en-us/um/people/simonpj/papers...
49.
▲
by
skew
15y ago
Then it sounds like you would want to learn about the runtime from this: http://hackage.haskell.org/trac/ghc/wiki/Commentary/Rts
50.
▲
by
skew
16y ago
What is most surprising is the claim on the Alice discussion that Ph.D theses are not reviewed.
51.
▲
by
skew
16y ago
This thread is the first time I've seen people consider these programming puzzles primarily as a test of memorization. The question is whether candidates can find a reasonable solution; it's a failure of the test if they already have seen t
52.
▲
by
skew
16y ago
If the empty subsequence is allowed, it's always possible to get at least zero.
53.
▲
by
skew
16y ago
Deconvolution is quick with Fourier transforms. In infinite precision, convolution by any nonzero function (which includes Gaussian blurs) is invertible. In practice, quantization and stopping the convolution at the edge of the blur region
54.
▲
by
skew
17y ago
For one, GHCi doesn't even provide the whole language. You can't define new types, classes, or instances, and as a matter of syntax you have to use explicit braces or semicolons for multi-line things. I haven't used it much, but O'Caml's RE