[Haskell-cafe] Lazy lists with with call-by-value reduction strategy.
flickyfrans at gmail.com
Tue Feb 11 21:46:47 UTC 2014
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?
More information about the Haskell-Cafe