IsTom

43 ms·

721.
by IsTom 14y ago
With the FP approach you can just write "show book as a widget" function yourself, without the whole inheritance hodge-podge. In case of real libraries the change of data structure probably won't be a problem as author would probably supply
722.
by IsTom 14y ago
Well, remember that it is "Digital Rights Management". It's the time it's about our rights. I hope it means that any DRM will be obliged to include a resale functionality.
723.
by IsTom 14y ago
As far as I know Linus' attitude is well-known.
724.
by IsTom 14y ago
Dialyzer is not very good. We've been using it, but it rarely catches anything non-trivial. On the other hand Haskell has a better support for unit tests than many of dynamic languages.
725.
by IsTom 14y ago
If you want a list of heterogenous "things" you either a list of "I don't care about what's on list" and then it should work without much in languages like Haskell, ML and the rest or you actually have list of things with a common property
726.
by IsTom 14y ago
What you are looking at are not two variables (strict, flexible), but also "ease of use". Arguably dependent-typed languages are most strict, but also most flexible: you can write type of a function that only accepts primes on input. They a
727.
by IsTom 14y ago
Recent years? 70s more like. ML way is to not write type annotations unless they're needed, not that I agree with it, but it certainly works in some way.
728.
by IsTom 14y ago
I haven't had an idea that Haskell's GL bindings were that nice.
729.
by IsTom 14y ago
People will look at each other and ask: "I always use CLOCK_MONOTONIC, do you ?"
730.
by IsTom 14y ago
Astronomers and physicists care a lot about this and they are the people running the clocks.
731.
by IsTom 14y ago
I'm not sure about slow (though probably it is slow), but it surely eats a lot of RAM. Lots and lots of RAM.
732.
by IsTom 14y ago
Purity is orthogonal to lambda abstractions. It's matter of what function can do (pure or not) and function creation (a lambda or something more verbose).
733.
by IsTom 14y ago
Things that can be libraries in other languages end up being "design patterns" in Java. It's just not flexible enouth, both Ruby and Haskell are more flexible than it. Both in different ways.
734.
by IsTom 14y ago
I haven't seen what was the weakness exploited in all these attacks -- perhaps it's a common vulnerability that was discovered by a group of bad guys.
735.
by IsTom 14y ago
And battery-backpack. Perhaps in some near future we will have a better power source.
736.
by IsTom 14y ago
100 Mb Ethernet doesn't sound like much. How performant are these ARM processors compared to x86-64? Are they 32 or 64 bit? What's the type or RAM?
737.
by IsTom 14y ago
Such combinations could end up worse sometimes, just like 2DES has the same strength as DES.
738.
by IsTom 14y ago
From my experience Haskell has two faces. One is the one that says "write a piece of software right with the tools I provide" and another is a messy "one"-liner (happens to me particularly when using pointfree style) with the "line" being
739.
by IsTom 14y ago
SHA-1 was designed as a cryptographic hash functions, they are puprposely slow. No, SHA-1 is not as fast as functions from the article.
740.
by IsTom 14y ago
It will simply crash with an error message.
741.
by IsTom 14y ago
I think you're confusing two kind of 'simplicity'. 'Apple' simplicity is in my eyes about cutting away what is not needed and unifying everything else. What author is talking about is simplicity that lies in roots UNIX-philosophy. It's abou
742.
by IsTom 14y ago
Existence of cache comes from trade-off between speed and cost, so it will quite likely never disappear. Notice how there are many layers of cache in current systems: HDD <-> HDD Cache <-> RAM <-> L3 ... <->
743.
by IsTom 14y ago
Actually Godel's proof is important to CS, it's an analogue of Turing's Proof concerning undecidable problems.
744.
by IsTom 14y ago
There are declarative ways of describing protocols.
745.
by IsTom 14y ago
If you're setting requirenments on password for yourself then perhaps you've got some problems. This is matter of security in systems with many users where industrial espionage or social engineering might happen.
746.
by IsTom 14y ago
we couldn't grow enough food to feed everyone without them We'd just eat more potatoes compared to wheat/fruits.
747.
by IsTom 14y ago
You still need to read O(nlogn) bits of the array. It can't take less than O(nlogn) time.
748.
by IsTom 15y ago
Undirected st-connectivity is UL complete (and by showing that it's in L it was shown that UL = L). Logarithmic space is just an arbitrary constraint. It could be polynomial or exp-space.
749.
by IsTom 15y ago
KV stores are painful to use. Only huge applications that are DB-bound have the problem of scaling database and they usually have a lot of money. Also you don't need your replicas to be as strong as your master db server.
750.
by IsTom 15y ago
You can think about decision problems (such that you answer "yes" or "no" to a question) as trying to find a path in (very specific) a graph. UL consists (in a hand-waving fashion) of problems that can be stated in such way by undirected gr

More ›