rpearl

34 ms·

331.
by rpearl 14y ago
Dropboxer here. We do not store passwords in plaintext, or unsalted. End sentence. :)
332.
by rpearl 14y ago
Some of them are only inhabited by bottom, no? I cannot write down a function f :: a -> b besides: f :: a -> b f = undefined
333.
by rpearl 14y ago
That is true, but the proposition is one that is encoded in the type. There are many derivations of certain proofs. Consider: map :: (a -> b) -> [a] -> [b] And [a] is shorthand for a recursive type: \forall a . \mu l .
334.
by rpearl 14y ago
git log -p or git log --patch
335.
by rpearl 14y ago
How well-made is "evil"? Do you ever have any issues with it because it's not really vim?
336.
by rpearl 14y ago
Try these out: "keygen" sort of thing (reversing): writeup: https://www.cs.cmu.edu/afs/cs.cmu.edu/academic/class/15213-f... , tarball: https://www.cs.cmu.edu/afs/cs.cmu.edu/academic/class/15213-f... Exploiting a variety of buffer overflo
337.
by rpearl 14y ago
No... it isn't. In fact, including free throws, which are a completely different scenario than regular shots, would be misleading and furthermore, not any more complete. Free throws and shots are very different: free throws are taken with
338.
by rpearl 14y ago
Glad to hear it--I've been looking into using clang more... This might just tip me towards it.
339.
by rpearl 14y ago
The following program compiles without warnings using gcc 4.7.0. The compiler uses the undefined behavior of accessing a variable that may not have been initialized to turn the conditional into one that's always taken, and then folds it a
340.
by rpearl 14y ago
Thank you for the contentless comment. Instead, you might consider offering a more interesting algorithm, its tradeoffs, and why it is beneficial to take more computation time?
341.
by rpearl 14y ago
I mean... there are surely not rainbow tables that span all 62^16 16-character passwords consisting of alphanumerics only: that is 646,081,519 zettabytes of hashes (62^16 * 128 bits). There are clearly rainbow tables which span a more u
342.
by rpearl 14y ago
Not really. The research, again, isn't in programmer usability. It's in formal logic and analysis of the semantics of computer programs. Benefits for programmers are just a side-benefit. The goal is advancing humanity's understanding of com
343.
by rpearl 14y ago
PL research is not necessarily for "contributing to programmer productivity." Formalization of various programming language concepts into a type system[0] allows researchers to apply analysis and verification techniques. The simplest exampl
344.
by rpearl 14y ago
Two's complement is not required; there might be systems that use saturating signed arithmetic for example.
345.
by rpearl 14y ago
Same position for me. Hopefully I'll find something as good--I just need a personal account and most of the other offerings are a lot more expensive and featureful than I really need. sigh
346.
by rpearl 14y ago
It would be cool if this feature implied no optimizations applied or something along those lines, making it intractable to use for production code.
347.
by rpearl 14y ago
I am quite aware of v8 and how Mozilla is "trying to beat them". I worked on Firefox's JIT. As it turns out, the optimizations in v8 don't do very much above the baseline JIT except in careful microbenchmarks: https://www.cs.cmu.edu/~ishaf
348.
by rpearl 14y ago
Sure, they are similar. It would be very strange, however, to argue that they are fragmentations of Lisp in the sense that Ocaml and SML are fragmentation of ML. They may share ideas since they are in the same semantic family (dynamically
349.
by rpearl 14y ago
Every time I use Chrome, my Macbook Pro becomes slow and everything pages to disk. It's snappy when it starts, but in Chrome 20 or whatever crazy version number they're on now, there's still a lot of leaks. It's very frustrating. But for so
350.
by rpearl 14y ago
I am dubious of this assertion. The original 1960 paper "Recursive Functions of Symbolic Expressions and Their Computation by Machine" introduces S-expressions and M-expressions as explicit entities (not as some abstract syntax, but as a li
351.
by rpearl 14y ago
Python and Ruby are both very fundamentally Not Lisp: Lisp's intentional s-expression syntax is very much a part of what makes Lisp powerful (it lets you write macros very easily, since code and data have the same representation). Python an
352.
by rpearl 15y ago
Sorry, I'm not really good at responding to comments fast on HN. The source is currently embarrassingly bad as I iterated through different ideas. I'm ...eventually... going to clean it up and put it on github though. It is based on modernc
353.
by rpearl 15y ago
Serif: Adobe Caslon Pro Sans: Optima LT std
354.
by rpearl 15y ago
I am a fan of XeTeX for this sort of thing. It lets you use modern otf fonts, rather than just the fonts that have been turned into LaTeX packages. I feel kinda silly posting my own as an example, but here goes: http://www.endofunctor.org/
355.
by rpearl 15y ago
> raising the skill level to contribute That's insane. Good programmers need not know stupid tiny nits about Javascript (heck, I've worked on a Javascript JIT and I don't really know Javascript). That does not mean that they are not ski
356.
by rpearl 15y ago
Google's revenue just by being an ad broker? $36 billion in 2011. As it turns out, people's priorities are making money. https://investor.google.com/financial/tables.html
357.
by rpearl 15y ago
Yes, absolutely. These measurements in the linked article are just a complete and utter lie. Edit: The sentence above is sarcastic. Firefox has had better memory usage than its competitors for a while now, despite the belief that it is leak
358.
by rpearl 15y ago
I don't understand this comment. Why do you care?
359.
by rpearl 15y ago
I am an undergrad and have read most of CLRS and the dragon book. And I will certainly read TAOCP once I have the money to reasonably justify spending it on the set. I wouldn't really want to ever read a book on design patterns.
360.
by rpearl 15y ago
It is technically possible. There is a plugin from before +relativenumber was a feature, called RltvNmbr[1]. It's a bit broken (doesn't update the line numbers very smoothly) but it displays the relative numbering side-by-side with the abso

More ›