jlouis

33 ms·

301.
by jlouis 11y ago
The advantage of making the distinction is you can discuss the subtly different semantics which often arise in the area of parallel, concurrent and distributed computing. If you equate them, you can only discuss with limited level of detail
302.
by jlouis 11y ago
This is, incidentally, also the Erlang default. Interrogate the system and if it is SMP capable, run with SMP enabled.
303.
by jlouis 11y ago
There is some nasty type conversion going on here, from the type of stochastic random throws of two nine-sided dice to floats to integers. Where is your type preservation, PHP?
304.
by jlouis 11y ago
How do you intend to achieve this?
305.
by jlouis 11y ago
Hmm, thinking some more on this, this holds locally in Erlang, but not in the distributed communication. If we have m1: A1 -> A2, m2: A1 -> A3 and then in m3: A3 -> A2, then the message ordering will always be that m1 comes before
306.
by jlouis 11y ago
I suspected as much. It is a pretty good guarantee. Have you found any use for it yet in programs? That is, a program where the causal message ordering is preferred and removes code from the program?
307.
by jlouis 11y ago
Your causal message ordering guarantee sounds exactly like the Erlang one. If a pair of processes (P1,P2) is given and P1 sends m1 then m2, then P2 will see them in that order, perhaps interleaved with messages from other Pids. But your cla
308.
by jlouis 11y ago
It's not the same thing. The post is talking about automatically figuring out that nobody knows the Pid of a process and hence that process can be reclaimed. This is a transitive notion: If a group of processes can't be "reac
309.
by jlouis 12y ago
Indeed. There are better strategies for splitting up the work among several processes than to spawn a new one per element. While processes in BEAM are fairly cheap, they are not free . So I think your point is valid.
310.
by jlouis 12y ago
This is essentially what will be possible now, with a 'CHANGE' event if the underlying clock suddenly warps/jumps to a new point in time. Your code has to be "time warp safe" in that it needs to handle this. Interes
311.
by jlouis 12y ago
Time here is on a per-node basis. No effort is made to synchronize time over multiple nodes. Partially because the problem is better solved with NTP, partially because time synchronization is so application-specific you don't want to s
312.
by jlouis 12y ago
The ultra-short variant of what is going on: Time in Erlang was historically used for many things: What time is it? How much time elapsed between points A and B? Give me time, use it as a unique timestamp. And so on. The old way Erlang hand
313.
by jlouis 12y ago
It is unification to a certain extent, but unification is slightly different IIRC the semantics correctly.
314.
by jlouis 12y ago
My first version didn't account for the Len field either. It was only after a while someone told me about its purpose via a hint.
315.
by jlouis 12y ago
Erlang runs about K threads where K is the number of cores towards the OS. All processes are "logical" in the same memory space and usually they happen to be pretty small with a heap of a few kilobytes. As long as this is the case
316.
by jlouis 12y ago
Look up how we usually encode IEEE 754 floating point numbers and then also think about endianess (little or big).
317.
by jlouis 12y ago
Now there is: https://github.com/jlouis/go-challenge-1 If you need a LICENSE, I can slam a MIT or Apache 2.0 on it for you, but...
318.
by jlouis 12y ago
Author here. I'll try to watch this and answer questions.
319.
by jlouis 12y ago
I think your point is discrete by creating a dichotomy in which you are either "right" or "wrong" while i'd err on the side of "the world is more complicated than it looks". You can't really win, but
320.
by jlouis 12y ago
As you already iterated, the non sequitur is that you can be right at one thing and still be wrong about another one. Which means that this argument doesn't really support the position. It is exactly the same position that you are not
321.
by jlouis 12y ago
Usually you don't keep the chain. You just keep a working compiler. You can also bootstrap from another implementation of the language, e.g., gccgo. A common trick is to keep a highly portable interpreted version of the target language
322.
by jlouis 12y ago
The primary reason is a long investment in wind energy, which could be a good reason for Apple to pick up Denmark.
323.
by jlouis 12y ago
None of those concepts seem unique to Jolie compared to Erlang, but I have yet to understand the concepts of Jolie well enough to figure out if something is conceptually different. Architectural programming: gen_server is a fine example. In
324.
by jlouis 12y ago
So, by your point of view, I should be able to submit the "Moo!" or "Ook!" esoteric languages which are exactly like this one? I find Groot to be entirely uninteresting. Look up Homespring or Flip :)
325.
by jlouis 12y ago
Introducing lagrangian relaxation quickly in a comment to a simulated annealing post is perhaps not the best way to convey a method. The machinery of mathematical programming you have to introduce quickly becomes an incomprehensible wall of
326.
by jlouis 12y ago
Indeed. This varies too much to be viable. In Denmark, the top-of-the-line 13" Macbook Pro sells for 13999 DKK (Roughly 1882 EUR - There are 25% VAT in .dk). Now, that price point is chosen for its locality to 14000, more than any othe
327.
by jlouis 12y ago
For the record in the interest of programmers who don't use Erlang on a daily basis: It is very common to use Erlang as a "glue" system between other subsystems in larger installations. You will often find the Erlang system c
328.
by jlouis 12y ago
It doesn't have to be a weaker stack per se. It is also a lot about knowledge. WhatsApp vested much time into understanding FreeBSD. It may be if you vested the equal amount of time on Linux with knowledgable people, then you would see
329.
by jlouis 12y ago
Even then, it is only a factor of 2 slower. That is next to nothing.
330.
by jlouis 12y ago
Random guesses from a Dane about tomorrow where the length of the sentence is to be determined. You can come back in 24 hours and vote based on the real outcome of a couple of these points, hehe: - Anakata will get a sentence somewhere in t

More ›