Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
dmytrish
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
26 ms
·
241.
▲
by
dmytrish
11y ago
Yep, I agree I was wrong (having too little experience in Prolog): variables are necessary to extract values from queries.
242.
▲
by
dmytrish
11y ago
Why? `?-` indicates that it's a query, it should not define anything.
243.
▲
by
dmytrish
11y ago
The `ToggleNumber()` function may be shortened to :set invnumber There two kind of prefixes for `:set` variables: `no-` and `inv-`, the first one turns the variable off or empties it, the second just toggles between states.
244.
▲
by
dmytrish
11y ago
Is corporate OS research really dead? We have L4, seL4, Xen, Mirage OS, Singularity nowadays. It's more like the focus has shifted from traditional OS kernels into virtualization, distributed systems and verification.
245.
▲
by
dmytrish
11y ago
I tried to run an original Plan 9 image, it is quite outdated (Ethernet configuration in QEMU silently fails, for example; half of its internet resources are either vanished or temporarily unavailable). Maybe, it's just not for beginne
246.
▲
by
dmytrish
11y ago
I wish your comment was formatted with some paragraphs :(
247.
▲
by
dmytrish
11y ago
At first, I thought that this is pretty harmless, but now I suspect that there may be a way to exploit a dump of public keys tied to personal information: let's say that some powerful adversary (like NSA) uses some kind of rainbow tabl
248.
▲
by
dmytrish
11y ago
Syntax does not matter much; Erlang's focus is not to be a good general-purpose language. It is good for distributed computing because it lacks many useful and pleasant features. Erlang has built-in immutability done right (more so t
249.
▲
by
dmytrish
11y ago
NxM BEAM processes will give you a real boost only if you have NxM physical cores to run code in parallel. Yes, Erlang makes clusters painless, but it's still more reasonable to use a single machine with a faster VM/native code.
250.
▲
by
dmytrish
11y ago
I tried reading "Thinking Forth", but never got why it is praised so much. Looks like a bunch of war stories from 80s from veterans who discovered some basics of encapsulation in need to handle Forth programs complexity.
251.
▲
by
dmytrish
11y ago
Android mobile browser requires the full signature chain of authorities who signed the site certificate[0]. It is done to avoid calls to CA servers and reduce network use on mobile devices. If a person does not concatenate authorities signa
252.
▲
by
dmytrish
11y ago
Can you disable a part of language reliably? For example, is there a way to ban `setf` in a package/file? If not, what's the point of pretending that a part of the language does not exist if anyone can break this status quo anyw
253.
▲
by
dmytrish
11y ago
Actually, Haskell is not a completely lazy language. It is (literally) "non-strict" and that means that it intersperses both modes. GHC tries to do its best with its strictness analyzer; it looks it works in many simple cases, sti
254.
▲
by
dmytrish
11y ago
Or, to get a continuous loop with timestamps: function talk { while read line ; do echo "$USER [`date +%T`]: $line" >> $talkfile ; done }
255.
▲
by
dmytrish
11y ago
Or gets_hit_done one.
256.
▲
by
dmytrish
11y ago
What about Xen development? Xen is very limited inside other virtual machines (learned that from my experience of mostly macbook usage).
257.
▲
by
dmytrish
11y ago
"I read a book about Java, and found it an elegant further development from C. But I have never used it. I did write some code in Java once, but the code was in C and Lisp (I simply happened to be in Java at the time)." - could so
258.
▲
by
dmytrish
11y ago
The same for my MacBook Air. I can't recall a single case when the built-in fan was so loud before.
259.
▲
by
dmytrish
12y ago
This definition of "the real math" is quite arguable. Doing a lot of computations efficiently is a realm of modeling and statistics; that does not clarify the very nature of computation, the inner laws of formal systems. Haskell i
260.
▲
by
dmytrish
12y ago
Previous discussions may be found here: https://news.ycombinator.com/item?id=2254557 I just could not help sharing this, this code is concise and clear even for a person who does not know OCaml much and implements diverse c
261.
▲
Programming Languages Zoo: a few toy languages implemented in OCaml
(andrej.com)
5 points
by
dmytrish
12y ago
|
1 comments
262.
▲
by
dmytrish
12y ago
Share of hydrogen in the atmosphere is almost negligible; nuclear fusion of ocean water is a bit more likely, although it still has to meet too many conditions.
263.
▲
by
dmytrish
12y ago
There is an old Soviet sci-fi book from 50s by Alexandr Kazantsev, "The Burning Island", where he depicted an island in the Pacific Ocean producing some catalyst that made self-sustaining exothermal reaction between nitrogen and o
264.
▲
by
dmytrish
12y ago
Pretty good implementation: > [] == [] false > [] + [] > {} + [] 0 > [] + {} [object Object] > {} + {} NaN Although it fails in this part (should be [10, NaN, 2]): > [10, 10,
265.
▲
by
dmytrish
12y ago
It's not only compile time that matters: an overcomplicated language grammar/specification hinders development of language infrastructure (static analyses tools, linters, debuggers, parsers/code generators, IDE interaction, e
266.
▲
by
dmytrish
12y ago
Yes, it's terrible to have a myriad of files each of fifty sparse lines. "Modern" languages like Java/C# tend to scatter code over many small files. I think it's a cultural thing: since IDEs do not have "split&
267.
▲
by
dmytrish
12y ago
Haskell does [partial?] type erasure, so RTS often knows nothing about types, it can't distinguish a pure function from any other one. The type consistence and runtime correctness is assured by the typechecker at compile time.
268.
▲
by
dmytrish
12y ago
This is an extreme exaggeration, but it illustrates the point that a C programmer writes some source code that produces effects only at runtime and the compiler may be thought of as a pure function (though, with a bit of external state, but
269.
▲
by
dmytrish
12y ago
The valid Haskell version would be: ... return (value1 == value2)
270.
▲
by
dmytrish
12y ago
Could you provide examples for a non-native English speaker? This is really interesting to me, I have not encountered obvious (for me) mistakes in the book yet, so it's a learning opportunity.
More ›