[gambit-list] What papers and strategies underly Gambit's design, in particular the compiler & VM?
patrickli.2001 at gmail.com
Wed Jun 13 20:08:14 EDT 2012
I have read through some articles on partial evaluation before, and found
that most of them are either too trivial (e.g. the popular printf partial
evaluator) or that the article immediately delves into the theory and too
quickly jumps into notation. An explanation of Gambit's partial evaluator
applied to a simple example, and a description of the various bookkeeping
datastructures used would be extremely helpful to me. The description of
the datastructures would be extremely helpful in particular. I am also
interested in whether the partial evaluator is built as a separate system,
or whether it is closely coupled with Gambit's interpreter.
Thanks very much!
On Wed, Jun 13, 2012 at 2:20 PM, Mikael <mikael.rcv at gmail.com> wrote:
> Am putting together a tree of questions for this currently.
> As for how the partial evaluator works, it would be great if you could
> please think of and tell here, how you would formulate one or more
> questions (in the same format as you would typically express them in a
> personal conversation), that together would communicate this understanding
> to you [of how the partial evaluator works].
> 2012/6/14 Patrick Li <patrickli.2001 at gmail.com>
>> - How the partial evaluator works
>> Seconded! I would love to hear about this also.
>> On Wed, Jun 13, 2012 at 2:00 PM, Alex Queiroz <asandroq at gmail.com> wrote:
>>> On Fri, Jun 8, 2012 at 11:44 PM, Mikael <mikael.rcv at gmail.com> wrote:
>>> > Anyone please feel free to suggest questions or angles on subjects that
>>> > should be addressed in this document, so that these will be covered
>>> - How the partial evaluator works
>>> Gambit-list mailing list
>>> Gambit-list at iro.umontreal.ca
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Gambit-list