I have to Point out that any such scheme as is being described would
need to be done quite carefully as to not break pass by reference data
semantics that Haskell enjoys/ the wealth of sharing
Moreover, as I understand it, something like this only is feasible in
general for statically sized data s
On Fri, Mar 26, 2010 at 10:52 PM, Mads Lindstrøm
wrote:
> Hi
>
> On Fri, 2010-03-26 at 21:33 +, Sebastian Sylvan wrote:
>
> >
> >
> > Reorganizing data on the fly sounds like it may be a pretty sensible
> > idea now that cache misses are so bad (in comparison). The fact that
> > Haskell data i
Hi
On Fri, 2010-03-26 at 21:33 +, Sebastian Sylvan wrote:
>
>
> Reorganizing data on the fly sounds like it may be a pretty sensible
> idea now that cache misses are so bad (in comparison). The fact that
> Haskell data is generally immutable helps too.
> However, I think your scheme sounds
Hi
On Fri, 2010-03-26 at 21:24 +, Sebastian Sylvan wrote:
>
>
> On Fri, Mar 26, 2010 at 9:21 PM, Brandon S. Allbery KF8NH
> wrote:
> On Mar 26, 2010, at 16:28 , Mads Lindstrøm wrote:
> For some time I have been thinking about an idea,
> which could li
On Fri, Mar 26, 2010 at 8:28 PM, Mads Lindstrøm wrote:
> Hi
>
> For some time I have been thinking about an idea, which could limit
> Haskell's memory footprint. I don't know if the idea is crazy or clever,
> but I would love to hear peoples thoughts about it. The short story is,
> I propose that
On Fri, Mar 26, 2010 at 11:21 PM, Brandon S. Allbery KF8NH
wrote:
> On Mar 26, 2010, at 16:28 , Mads Lindstrøm wrote:
>>
>> For some time I have been thinking about an idea, which could limit
>> Haskell's memory footprint. I don't know if the idea is crazy or clever,
>
> This is called pointer tag
On Fri, Mar 26, 2010 at 9:21 PM, Brandon S. Allbery KF8NH <
allb...@ece.cmu.edu> wrote:
> On Mar 26, 2010, at 16:28 , Mads Lindstrøm wrote:
>
>> For some time I have been thinking about an idea, which could limit
>> Haskell's memory footprint. I don't know if the idea is crazy or clever,
>>
>
> Th
On Mar 26, 2010, at 16:28 , Mads Lindstrøm wrote:
For some time I have been thinking about an idea, which could limit
Haskell's memory footprint. I don't know if the idea is crazy or
clever,
This is called pointer tagging. The original STG design avoided it
because of the perceived perform
Hi
For some time I have been thinking about an idea, which could limit
Haskell's memory footprint. I don't know if the idea is crazy or clever,
but I would love to hear peoples thoughts about it. The short story is,
I propose that the garbage collector should not just reclaim unused
memory, it sho
