On Fri 11 Aug, George Russell wrote: > However REALLY worst-time-bounded garbage collection is very expensive in > CPU time. (Is there anything better than Baker's train algorithm?) > In any case even if you do have garbage-collection, you will still need to > demonstrate that you won't run out of memory. And if you're going to > do that sort of analysis, wouldn't it be better to use something like > MLKit's regions rather than garbage collection? I think this sentiment sums up my feelings pretty well. I'm not sure how the MLFix solution would fit with Haskell. Regards -- Adrian Hey
- GC in embedded systems (was Re: Haskell and the N... Adrian Hey
- Re: GC in embedded systems (was Re: Haskell ... Byron Hale
- Re: GC in embedded systems (was Re: Hask... Manuel M. T. Chakravarty
- Re: GC in embedded systems (was Re: Hask... Adrian Hey
- Re: GC in embedded systems (was Re: Haskell ... Manuel M. T. Chakravarty
- Re: GC in embedded systems (was Re: Hask... Adrian Hey
- Re: GC in embedded systems (was Re: Haskell ... Sengan
- Re: GC in embedded systems (was Re: Hask... Adrian Hey
- Re: GC in embedded systems (was Re: Haskell ... George Russell
- Re: GC in embedded systems (was Re: Hask... George Russell
- Re: GC in embedded systems (was Re: Hask... Adrian Hey
- Re: GC in embedded systems (was Re: Hask... George Russell