I did not see this CfP going through Guile mailling list,
so here is it. Deadline is monday!
DEADLINE: 9 July 2018, (Any time in the world)
WEBSITE: https://brinckerhoff.org/scheme2018/
LOCATION: St. Louis, MO, USA (co-located with ICFP and Strange Loop)
DATE: 28 September 2018 (Friday)
The 201
Hi Mark,
Thanks for your support and time.
On 2018-07-05 20:30, Mark H Weaver wrote:
Hi,
Amirouche Boubekki writes:
I have a program that try to download hackernews locally.
What it does is simple, it fetch the max identifier and
http-get each json value starting with the most recent
item.
Hi,
Amirouche Boubekki writes:
> I have a program that try to download hackernews locally.
>
> What it does is simple, it fetch the max identifier and
> http-get each json value starting with the most recent
> item. I use n-for-each-par-map with 16 threads I have
> 8 cores.
>
> Here is the full
Hi :)
On Mon 02 Jul 2018 11:28, l...@gnu.org (Ludovic Courtès) writes:
> Andy Wingo skribis:
>
>> My current plan is that the frame overhead will still be two slots: the
>> saved previous FP, and the saved return address. Right now the return
>> address is always a bytecode address. In the fut
I have a program that try to download hackernews locally.
What it does is simple, it fetch the max identifier and
http-get each json value starting with the most recent
item. I use n-for-each-par-map with 16 threads I have
8 cores.
Here is the full program:
(define-module (hn))
(use-modules (s
