[Haskell-cafe] Lazy lists with with call-by-value reduction strategy.

[Roman Cheplyaka]

Except Scheme is not pure — they use set! to achieve memoisation.

I don't think the OP bothers with memoisation in his/her encoding,
though.

Roman

* Kyle Marek-Spartz <kyle.marek.spartz at gmail.com> [2014-02-11 15:54:34-0600]
> SICP comes to mind: http://mitpress.mit.edu/sicp/full-text/sicp/book/node70.html
> 
> --  
> Kyle Marek-Spartz
> 
> On February 11, 2014 at 3:47:09 PM, flicky frans (flickyfrans at gmail.com) wrote:
> >  
> > Hello. I am currently writing lists with lazy semantics in the  
> > pure
> > lambda-calculus with call-by-value reduction strategy.
> > Here is an example: http://pastebin.com/SvQ5hCSD
> > Here is a simple interpetator: http://pastebin.com/mejCWqpu  
> > Am I reinventing the wheel? Are there some sources, from where  
> > i can
> > learn more about lazy evaluation in the strict languages?
> > _______________________________________________
> > Haskell-Cafe mailing list
> > Haskell-Cafe at haskell.org
> > http://www.haskell.org/mailman/listinfo/haskell-cafe  
> >  
> 
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 819 bytes
Desc: Digital signature
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20140212/bcbb2ce5/attachment.sig>