[Haskell-cafe] Re: How many "Haskell Engineer I/II/III"s are there?

[John Van Enk]

I _think_ that the abstract points out that reference-counted garbage
collection can be done deterministically. Haskell could some day be an
excellent replacement for C/Ada in safety critical markets, but some serious
changes to the RTS (most having to do with memory allocation, garbage
collection, and multi-threading) would have to be made.

If the GC becomes deterministic, then a much better case can be made for
using the language on a plane or in medical devices.

/jve

On Fri, Feb 12, 2010 at 10:29 AM, Simon Marlow <marlowsd at gmail.com> wrote:

> On 11/02/2010 17:01, John Van Enk wrote:
>
>> Here's the paper:
>> http://comjnl.oxfordjournals.org/cgi/content/abstract/33/5/466
>>
>
> Can you say a bit about why that GC fits your needs?  Must it be that
> particular algorithm?  I don't seem to be able to find the paper online.
>
> Replacing GHC's RTS is no mean feat, as you're probably aware.  There are a
> large number of dependencies between the compiler, the RTS, and the
> low-level libraries.  I expect rather than thinking about replacing the RTS
> it would be more profitable to look at what kinds of things you need the RTS
> to do that it currently does not.
>
> I'm aware that some people need a GC with shorter pause times.  We'll
> probably put that on the roadmap at some point.
>
> Cheers,
>        Simon
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20100212/616b1323/attachment.html