One approach to implementing this, which I've also been thinking of
for
maintaining Bicicleta intermediate results, would be to use a value-
weak
hashtable for the memoization table, along with a garbage collector.
Any value that is needed again while it's still in the nursery will
not
need
Dave Long dave.l...@bluewin.ch writes:
A design that I'd like to try sometime would be to try an Elephant-
like language, in which all values would, in principle, be
recoverable from a logfile. This could eliminate GC, as frequently
used values would tend to be instantiated in a cache,
- Forwarded message from Kragen Javier Sitaker [EMAIL PROTECTED] -
From: Kragen Javier Sitaker [EMAIL PROTECTED]
To: Amit Patel [EMAIL PROTECTED]
Subject: Re: PEGs
On Mon, Dec 01, 2008 at 12:06:09PM -0800, Amit Patel wrote:
Hi Kragen,
Hi!
By the way, would you mind if I forwarded this
