Thanks Robby & Joe - this gives me the sketch I needed to see how it will work. Thanks again. <br><br><div class="gmail_quote">On Fri, Oct 8, 2010 at 12:46 PM, Robby Findler <span dir="ltr"><<a href="mailto:robby@eecs.northwestern.edu">robby@eecs.northwestern.edu</a>></span> wrote:<br> <blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">If you are after an eduction, you can just make yourself a big array<br> and write a compiler / runtime system that uses that array instead of<br> calling 'cons'.<br> <br> Shriram's PLAI has a module on garbage collectors that does this<br> extremely well (by taking away some of the annoying work and letting<br> you focus on the interesting bits, namely the gc algorithms and data<br> layout issues).<br> <br> Robby<br> <div><div></div><div class="h5"><br> On Fri, Oct 8, 2010 at 2:41 PM, Joe Marshall <<a href="mailto:jmarshall@alum.mit.edu">jmarshall@alum.mit.edu</a>> wrote:<br> > On Fri, Oct 8, 2010 at 11:49 AM, YC <<a href="mailto:yinso.chen@gmail.com">yinso.chen@gmail.com</a>> wrote:<br> >> Hi all -<br> >> I have a rather curious question - is it possible to write a garbage<br> >> collector in a pointerless language such as racket/scheme?<br> ><br> > It is possible if the system provides a good API to the underlying<br> > memory architecture. The Scheme standard does not specify or<br> > require such a thing, so there is no portable way to hook into the<br> > garbage collector.<br> ><br> ></div></div></blockquote></div>