Awesome! Thank you.<br><br><div class="gmail_quote">On Wed, Nov 17, 2010 at 4:10 PM, David Sabel <span dir="ltr"><<a href="mailto:sabel@ki.informatik.uni-frankfurt.de">sabel@ki.informatik.uni-frankfurt.de</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
<div text="#000000" bgcolor="#ffffff">
As a starting point I would suggest<br>
Peter Sestoft : Deriving a lazy abstract machine, Journal of
Functional Programming 7(3), 1997<br>
( <a href="http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.4314" target="_blank">http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.4314</a> )<br>
Different abstract machines for call-by-need evaluation are built
starting from Launchburys natural semantics,<br>
the alpha renaming problem is discussed and solved by using
environments and at the end by using a nameless<br>
representation for variables.<br>
<br>
Regards,<br>
David<br>
<br>
Am 17.11.2010 22:02, schrieb David Sankel:
<blockquote type="cite"><div><div></div><div class="h5">I'm writing an interpreter for a call by need language
and have been doing a direct implementation of the Launchbury
semantics. My problem is that in the variable rule, an alpha
conversion is done that, as far as I understand, is going to
hinder any tail call optimization.
<div>
<br>
</div>
<div>I realize that the intent of Launchbury's paper is to come up
with a theoretical framework for call by need, not to guide an
implementation per say. Is anyone aware of any papers out there
that go into detail on the construction of an
actual interpreter?</div>
<div><br>
</div>
<div>TIA,</div>
<div><br>
</div>
<div>David<br clear="all">
<br></div></div></div></blockquote></div></blockquote></div><br><br clear="all"><br>-- <br>David Sankel<br>Sankel Software<br><a href="http://www.sankelsoftware.com">www.sankelsoftware.com</a><br>585 617 4748 (Office)<br>