Re: Incrementally implementing a simple ML compiler using LLVM

Jon Harrop <usenet@jdh30.plus.com>
Fri, 30 Nov 2007 09:09:15 +0000

          From comp.compilers

Related articles
Incrementally implementing a simple ML compiler using LLVM usenet@jdh30.plus.com (Jon Harrop) (2007-11-26)
Re: Incrementally implementing a simple ML compiler using LLVM torbenm@app-2.diku.dk (2007-11-27)
Re: Incrementally implementing a simple ML compiler using LLVM gneuner2@comcast.net (George Neuner) (2007-11-28)
Re: Incrementally implementing a simple ML compiler using LLVM pertti.kellomaki@tut.fi (=?ISO-8859-1?Q?Pertti_Kellom=E4ki?=) (2007-11-29)
Re: Incrementally implementing a simple ML compiler using LLVM jo@durchholz.org (Joachim Durchholz) (2007-11-29)
Re: Incrementally implementing a simple ML compiler using LLVM usenet@jdh30.plus.com (Jon Harrop) (2007-11-30)
| List of all articles for this month |

From: Jon Harrop <usenet@jdh30.plus.com>
Newsgroups: comp.compilers
Date: Fri, 30 Nov 2007 09:09:15 +0000
Organization: Flying Frog Consultancy Ltd.
References: 07-11-072 07-11-077 07-11-080
Keywords: ML, functional
Posted-Date: 30 Nov 2007 20:34:07 EST

Pertti Kellomdki wrote:
> George Neuner wrote
>> If you are really interested in GC implementation, you should read the
>> bible:
>> Jones & Lins, "Garbage Collection: Algorithms for Automatic Dynamic
>> Memory Management", 1996, ISBN 0-471-94148-4.
>> http://www.wiley.com/WileyCDA/WileyTitle/productCd-0471941484.html


I already had this book and had forgotten to read it! :-)


>> Also see Richard Jones's GC pages:
>> http://www.cs.kent.ac.uk/people/staff/rej/gc.html
>> http://www.cs.kent.ac.uk/people/staff/rej/gcbib/gcbibM.html
>
> Wilson's Uniprocessor Garbage Collection is also a good source:
> <ftp://ftp.cs.utexas.edu/pub/garbage/bigsurv.ps>


Wow, that looks great too.


Many thanks,
--
Dr Jon D Harrop, Flying Frog Consultancy Ltd.
http://www.ffconsultancy.com/products/?u


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.