On 18/11/2014 18:03, Mathieu Boespflug wrote:
On 18 November 2014 16:59, Simon Peyton Jones simo...@microsoft.com wrote:
Isn't it this simple: the Static Pointer Table must be a source of roots for
the garbage collector. Of course! An item in the SPT may be looked up at any
time.
As
Hi Facundo,
You are completely right, the CAF named g might be accessed at any
time during the program execution. Parallel Haskell systems with
distributed heap (and runtime-supported serialisation) need to keep all
CAFS alive for this reason.
Some comments inline along your mail:
While
| -Original Message-
| From: ghc-devs [mailto:ghc-devs-boun...@haskell.org] On Behalf Of
| Facundo DomÃnguez
| Sent: 18 November 2014 00:44
| To: ghc-devs@haskell.org
| Subject: Fwd: Garbage collection
|
| Hello,
| While working in the StaticPointers language extension [1], we
On 18 November 2014 16:59, Simon Peyton Jones simo...@microsoft.com wrote:
Isn't it this simple: the Static Pointer Table must be a source of roots for
the garbage collector. Of course! An item in the SPT may be looked up at
any time.
As Facundo says, the existence of the SPT would solve
