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

Kyle Marek-Spartz kyle.marek.spartz at gmail.com
Tue Feb 11 21:54:34 UTC 2014

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  

More information about the Haskell-Cafe mailing list