[Haskell-cafe] Re: I love purity, but it's killing me.

[Chung-chieh Shan]

On 2009-05-27T03:58:58-0400, Paul L wrote:
> One possible solution is to further introduce a fixed point data
> constructor, a Rec or even LetRec to explicitly capture cycles. But
> then you still incur much overheads interpreting them,

I don't understand this criticism -- what interpretive overhead do you
mean?  Certainly the Rec/LetRec encoding is pretty efficient for one
object language with cycles, namely the lambda calculus with Rec or
LetRec. :)

One concrete way for you to explain what interpretive overhead you mean,
if it's not too much trouble, might be to compare a Rec/LetRec encoding
of a particular object language to another encoding that does not have
the interpretive overhead you mean and is therefore more efficient.

-- 
Edit this signature at http://www.digitas.harvard.edu/cgi-bin/ken/sig
We want our revolution, and we want it now! -- Marat/Sade
We want our revolution, and we'll take it at such time as  
 you've gotten around to delivering it      -- Haskell programmer
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 189 bytes
Desc: Digital signature
Url : http://www.haskell.org/pipermail/haskell-cafe/attachments/20090606/7bcd5db3/attachment.bin