[mailto:haskell-boun...@haskell.org] On
| Behalf Of Simon Marlow
| Sent: 04 August 2009 14:50
| To: Sam Martin
| Cc: Colin Runciman; Haskell@haskell.org
| Subject: Re: [Haskell] memory management
|
| On 04/08/2009 13:33, Sam Martin wrote:
| Sounds like region inference to me.
| (https
| In the early to mid '90s we built various heap-profiling tools to
| examine the characteristics of heap data in lazy functional programs.
| You can find papers describing this work by Googling heap profiling.
| You may be particularly interested in the investigation of heap lag
| and heap drag
On 06/08/2009 08:22, Simon Peyton-Jones wrote:
| In the early to mid '90s we built various heap-profiling tools to
| examine the characteristics of heap data in lazy functional programs.
| You can find papers describing this work by Googling heap profiling.
| You may be particularly interested
for these
situations?
Cheers,
Sam
-Original Message-
From: Simon Peyton-Jones [mailto:simo...@microsoft.com]
Sent: 06 August 2009 08:23
To: Simon Marlow; Sam Martin
Cc: Colin Runciman; Haskell@haskell.org
Subject: RE: [Haskell] memory management
Also region inference is likely to be much
| -Original Message-
| From: haskell-boun...@haskell.org [mailto:haskell-boun...@haskell.org]
On
| Behalf Of Simon Marlow
| Sent: 04 August 2009 14:50
| To: Sam Martin
| Cc: Colin Runciman; Haskell@haskell.org
| Subject: Re: [Haskell] memory management
|
| On 04/08/2009 13:33, Sam
Nathan,
I'm interested in research relating to memory management in
Haskell. I'm at the point where I don't know enough to have very
specific questions, but I'm especially interested in garbage collection
in Haskell, and any available statistics (such as, how long does a thunk
typically
]
On Behalf Of Colin Runciman
Sent: 04 August 2009 12:06
To: Nathan Ricci
Cc: Haskell@haskell.org
Subject: Re: [Haskell] memory management
Nathan,
I'm interested in research relating to memory management in
Haskell. I'm at the point where I don't know enough to have very
specific questions
On Tue, Aug 4, 2009 at 7:30 AM, Sam Martinsam.mar...@geomerics.com wrote:
I can picture similar situations arising in Haskell where for suitable
expressions the compiler could in theory determine that garbage
collection would be unnecessary for a lump of temporary data and simply
Sounds like region inference to me.
(https://secure.wikimedia.org/wikipedia/en/wiki/Region_inference)
Thanks, yes, that's exactly what I had in mind.
Is anything like this is done in GHC?
Ta,
Sam
___
Haskell mailing list
Haskell@haskell.org
On 04/08/2009 13:33, Sam Martin wrote:
Sounds like region inference to me.
(https://secure.wikimedia.org/wikipedia/en/wiki/Region_inference)
Thanks, yes, that's exactly what I had in mind.
Is anything like this is done in GHC?
Not at the moment, no.
Bear in mind that with generational GC,
Hi,
staying in the realm of the explicit and pragmatic, various libraries
in Haskell do provide safeexplicit region/alloca/stack allocation
actions, e.g.,
Foreign.Marshal.Alloc.allocaBytes :: Int - (Ptr a - IO b) - IO b
with the promise that the pointer doesn't escape here (you could
On Tue, Aug 4, 2009 at 2:49 PM, Simon Marlow marlo...@gmail.com wrote:
On 04/08/2009 13:33, Sam Martin wrote:
Sounds like region inference to me.
(https://secure.wikimedia.org/wikipedia/en/wiki/Region_inference)
Thanks, yes, that's exactly what I had in mind.
Is anything like this is
2009/8/3 Nathan Ricci nricc...@eecs.tufts.edu:
Hello,
I'm interested in research relating to memory management in Haskell. I'm
at the point where I don't know enough to have very specific questions, but
I'm especially interested in garbage collection in Haskell, and any
available
nricci01:
Hello,
I'm interested in research relating to memory management in
Haskell. I'm at the point where I don't know enough to have very
specific questions, but I'm especially interested in garbage collection
in Haskell, and any available statistics (such as, how long does a
14 matches
Mail list logo
