l...@gnu.org (Ludovic Courtès) writes:
> Andy Wingo skribis:
>
>> But OK, the question here is, what if another thread is concurrently
>> mutating X and Y? If this were C++ or Java, the answer would be that
>> they can still fold, because access to a multithreaded mutable needs to
>> be synchron
Hi,
Andy Wingo skribis:
> But OK, the question here is, what if another thread is concurrently
> mutating X and Y? If this were C++ or Java, the answer would be that
> they can still fold, because access to a multithreaded mutable needs to
> be synchronized. I think this is reasonable. What d
hi Stefan! I saw your guile-log based on Guile got good efficiency!
But I'm not sure what the "log" mean, could it possible be an
efficient logger for a server?
If it does, I plan to use it in my server project. My logger module is
very ugly before optimization.
On Sun, Apr 15, 2012 at 7:54 PM, St
Hi,
I've looked at one benchmark for the einstein case. (some numbers are from
my memory)
compiled prolog
12-14ms
guile-log, stack-based, with added vm ops
30-40ms
kanren, compiled chicken
~250ms
guile-log, stack based,
250ms
guile-log, assq-based
500ms
kanren on guile
2000ms
kanren on guil
Andy Wingo writes:
> But OK, the question here is, what if another thread is concurrently
> mutating X and Y? If this were C++ or Java, the answer would be that
> they can still fold, because access to a multithreaded mutable needs
> to be synchronized. I think this is reasonable. What do you
