Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
sa1
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
22 ms
·
211.
▲
by
sa1
8y ago
The paper goes on to say that > Unfortunately, in practice it would seem that SMT solvers are monolithic, and SMT internals expertise is required for implementing new theory solvers. and > We argue that programmers should not have to
212.
▲
by
sa1
8y ago
Indeed, it's painful to get notes into Anki currently. I would prefer if I could get any text selected into a new Anki note with minimum number of keypresses, rather than creating flashcards in Polar and then syncing them, which seems
213.
▲
by
sa1
8y ago
It only reads like a troll piece because you are deliberately taking his statements in an adversarial context. It's weird to complain about the tone of other posts, and then go on to write a comment like yours. > This is an explaina
214.
▲
by
sa1
8y ago
Would be even weirder to put it in same bucket as Rust, which uses compile-time analysis to solve the problem.
215.
▲
by
sa1
8y ago
You don't see that prompt if you aren't signed in.
216.
▲
by
sa1
8y ago
The idea that they need to provide space for activities other than quiet reading is even more odd.
217.
▲
by
sa1
9y ago
The responsibility of proving safety can belong to the compiler or it could belong to the programmer. The compiler can do a very good job, but there are edge cases where your code can become convoluted and things aren't expressed easil
218.
▲
by
sa1
10y ago
Their past tactic used to be to arrest researchers who pointed out flaws in the machines. I'm not sure anything much has changed.
219.
▲
by
sa1
10y ago
Net neutrality regulation, India.
220.
▲
by
sa1
10y ago
It has prevented zero-rating of video and social media services in practice.
221.
▲
by
sa1
10y ago
Laws and regulations won't be made per site. Net neutrality regulation would be effective only if you don't leave in backdoors via exceptions. Also, Wikipedia, being text-heavy and without obtrusive ads, is not something for whic
222.
▲
by
sa1
10y ago
I'm sorry, I was not talking about Feldman, just about your parent comment.
223.
▲
by
sa1
10y ago
You shared the estimate for the number of atoms in the observable universe. afaik, we don't have an estimate for the unobservable universe.
224.
▲
by
sa1
10y ago
Since when is visibility expected from corporate codebases?
225.
▲
by
sa1
10y ago
Lazy evaluation does make understanding performance/memory behavior hard, but usually you'll be using pipes/conduit/machines instead of lazy lists in production code, so its not much of an obstacle for real-time behavior
226.
▲
by
sa1
10y ago
Standard Chartered has some 3 million lines of Haskell, but they don't use GHC, they have their own internal compiler.
227.
▲
by
sa1
10y ago
This State of the Haskell Ecosystem doc[1] is very informative. If you're looking at application domains, Haskell(and OCaml etc) is usually well suited for writing compilers, but its not bad for your usual server-side application eithe
228.
▲
by
sa1
10y ago
That's not really the Sieve of Eratosthenes. The list data structure is not well suited for the algorithm. See [1] for a proper discussion. As someone who wants to write Haskell(and loves it) for code with mathematically well defined g
229.
▲
by
sa1
10y ago
What is real-life mathematics ability?
230.
▲
by
sa1
10y ago
Similar tricks have been tried it with tigers: https://en.wikipedia.org/wiki/Tiger_attacks_in_the_Sundarban... Apparently tigers figure it out fast enough.
231.
▲
by
sa1
10y ago
The https://en.wikipedia.org/wiki/Curry–Howard_correspondence says there is a correspondence between any logical statement and a type in a sufficiently advanced type system. So yes, there are languages aimed at elimina
232.
▲
by
sa1
10y ago
Dealing with null and undefined cases is a significant practical advantage of a modern type-system. Compilers can catch most of them. Also you can encode your logic in types - The Curry-Howard Correspondence ( https://en.wikipedia
233.
▲
by
sa1
11y ago
Admittedly, Haskell is less preemptive than Erlang, but definitely not at the same level as Go. A mutating variable is not what you commonly use in Haskell, so the idiomatic equivalent of your code would have memory accesses anyway, and it
234.
▲
Poverty and Classism: The Silent Diversity Issue
(medium.com)
3 points
by
sa1
11y ago
|
0 comments
235.
▲
by
sa1
11y ago
Aadhaar is India's national unique identity program, and has collected biometric and other personal data of over 1 billion people. These people have done an impressive work of deduplicating so many identities based on both fingerprint
236.
▲
Aadhaar: Technology and Architecture [pdf]
(uidai.gov.in)
5 points
by
sa1
11y ago
|
1 comments
237.
▲
by
sa1
11y ago
A combination of tuning the runtime heap size, number of threads and compiling with -threaded made the same implementation run in 0.5s for me.
238.
▲
by
sa1
11y ago
While peering enables this, the real problem is that all these ISPs provide YouTube at a much higher speed than the rest of the web, which means that your bandwidth is not enough to stream videos without buffering for any other video site,
239.
▲
by
sa1
11y ago
Free VPNs do not mean that ISP's won't charge you for the data.
240.
▲
by
sa1
11y ago
One issue is that it won't be possible to have regulation that doesn't prevent Free Basics, but prevents other abuses of not having net neutrality. Such as having lots of subsets of the internet being offered for free or cheap, an
More ›