first_amendment

7 ms·

1.
by first_amendment 9y ago
Jokes aside, semantically "implore" and "swear" are actually really good primitives for static analysis. "swear" is only dangerous because there's a chance it gets out of sync with the code it's swear
2.
by first_amendment 9y ago
One is a requirement, the other is a promise. The promise "result >= 0" is necessary because the compiler may not be able to prove that on its own.
3.
by first_amendment 9y ago
I'm not talking about unikernels. I'm talking about the VMs that isolate them from each other. The VM isolation mechanism is considered secure enough to isolate malicious users, while the container isolation mechanism isn't (
4.
by first_amendment 9y ago
Unfortunately containers aren't considered secure enough for malicious users while VMs are.
5.
Tcpcrypt – Encrypting the Internet(tcpcrypt.org)
1 points by first_amendment 9y ago|0 comments
6.
by first_amendment 9y ago
Hard work and smart investing sustained over a period of 30 years.
7.
by first_amendment 9y ago
As it stands now, adding threading to JS has a negative expected value. There is more potential downside than potential upside. It's illogical and irrational to undertake the effort under those conditions. This should be an industry dr
8.
by first_amendment 9y ago
JavaScript can already do concurrent searching. Concurrent is logical, parallel is physical. Efficient parallel GC is non-trivial to implement. In the most common implementation, you have to pause all threads before you can collect. That wi
9.
by first_amendment 9y ago
C++11 allows you to write natural "value-oriented" code without paying a copying cost. This is thanks to RVO (return value optimization) and move semantics.
10.
by first_amendment 9y ago
I made an argument. What's yours? You just made a statement of opinion without any justification. Additionally your opinion is wrong, by simple counter example. Rust's type checker already has the ability to prevent data races: h
11.
by first_amendment 9y ago
For your parallel search example, the data set has to be extremely large for parallel searching to have a significant improvement. When does a client-side JS app have access to many GBs of local data that would justify a parallel algorithm?
12.
by first_amendment 9y ago
This isn't about "paternalistic caution," it's about purposeful and sensible engineering. JavaScript wasn't designed for threading, and it's a less natural fit for it compared to a language like C, so this is u
13.
by first_amendment 9y ago
> I just don't think that we have sufficient evidence to conclude that using type systems to aid the development of concurrent code actually leads to better concurrent code. This is like saying we don't have evidence that evo
14.
by first_amendment 9y ago
JavaScript is already concurrent. It isn't parallel though. Is there any real world application that currently cannot exist without this feature? It seems like a solution looking for a problem. I can see needing the ability for paralle
15.
by first_amendment 9y ago
It's unfortunate that the new version still creates __new__ using exec(). Doesn't seem necessary at all. Instead of generating the method as a string with the argument names filled in, why not use use a combination of * n and * *
16.
by first_amendment 9y ago
Only versions 1.4 and below. Versions 1.5 and above do not require an X server. Version 1.5 has been available for 5+ years: https://ariya.io/2012/03/pure-headless-phantomjs-no-x11-or-x...
17.
by first_amendment 9y ago
Feistel is a permutation. That means it's a 1:1 mapping between a 16-bit # to another 16-bit #. You run Feistel for each number 0->65535 (corresponding to the "stage" of the FizzleFade) and out comes the pixel to redden at
18.
by first_amendment 9y ago
You should time it :)
19.
by first_amendment 9y ago
Always love seeing applications of Feistel cipher. Used it with AES as the PRF for implementing FPE in legacy systems. Just want to note that this approach (regardless of PRF) probably wouldn't have worked in 1991. Recomputing the ciph
20.
by first_amendment 9y ago
Erlang occupies a similar space compared to Haskell, in terms if it being a functional language with M:N green threads. It is possible, there are many stack swapping libraries in C that don't use garbage collection/excessive heap
21.
by first_amendment 9y ago
I approximately agree with you but there are lots of reasons I'd prefer Rust over Haskell. All data is thunked and boxed in Haskell, it's all heap-allocated and garbage collected, and polymorphism is through indirect pointers. Rus
22.
by first_amendment 9y ago
Interesting. The problems section isn't really convincing to me though. Especially, indirect function calls for IO functions seem fine since IO is usually much slower than a function call. Also binary size increase may not be a problem
23.
by first_amendment 9y ago
I wonder if Rust could support pluggable concurrency models (with the accompanying runtime support). That's what Haskell does and it seems to work. At the outset that seems like a better approach than creating an incompatible sub-langu
24.
by first_amendment 9y ago
async/await is nice duct tape to integrate cooperative concurrency into a thread-based concurrency model but it has the drawback of creating an incompatible sub-language for functions within the parent language. Now every time you cal
25.
by first_amendment 9y ago
You essentially agree with me. Aborting with a stack trace is still an abort. It doesn't need to be catchable.
26.
by first_amendment 9y ago
Unbelievable this is downvoted. Do people not approve of the patent system? It has been in place for decades as a battle-tested way of incentivizing innovation and creates a natural process for getting trade secrets into the public domain.
27.
by first_amendment 9y ago
Patent the idea, Publish a paper, submit it to a robotics conference. Some big company with deep pockets will buy the rights to your patent for a sum of money that will be large to you and small for them.
28.
by first_amendment 9y ago
A runtime exception is fine to handle. Like ENOENT, etc. these are expected and your program can be designed to handle these errors. A programming error is a sign that your program is not operating the way you expect. No correct program sho
29.
by first_amendment 9y ago
If that's what Linux does, that seems fully intentional and the possible consequences on kernel state are probably well-thought out. Are you claiming what Linux does normally is unsafe and could possibly corrupt kernel state? Like ever
30.
by first_amendment 9y ago
Just because Rust has safe guards for lock usage during unwinds doesn't mean it prevents all high level data structure inconsistencies or even just plain old bugs. Doesn't matter how you choose to handle invalid semantic forms, ei

More ›