Mauricio Fernandez wrote:
> On Mon, Nov 10, 2008 at 05:31:15PM +0100, Florian Lorenzen wrote:
> See stdlib/camlinternalLazy.ml --- force takes but 6 lines of code.
Thank you Mauricio. That pointer helped.
Regards,
Florian
signature.asc
Description: OpenPGP digital signature
___
If I may advertise myself, have a look at the implementation of
MiniHaskell at the PL Zoo, http://andrej.com/plzoo/ . It has lazy
lists, and the code is supposed to be educational.
Hmm, looking at interp.ml I see that it's not as call-by-need as it
could be. So, a good exercise then is to fix the
On Mon, Nov 10, 2008 at 05:31:15PM +0100, Florian Lorenzen wrote:
> Hello,
>
> I would like to know how lazy datatype constructors are implemented in
> OCaml. A look into the documentation of the Lazy module revealed that
> the compiler uses a built-in type constructor lazy_t for this
> purpose. U
On Mon, 2008-11-10 at 17:31 +0100, Florian Lorenzen wrote:
> Especially, if
> lazy_t implements call-by-need in the sense that once evaluated
> objects are not evaluated again (by means of sharing) or if it
> implements call-by-name like one can do by inserting 0-ary lambda
> abstractions in the c
Hello,
I would like to know how lazy datatype constructors are implemented in
OCaml. A look into the documentation of the Lazy module revealed that
the compiler uses a built-in type constructor lazy_t for this
purpose. Unfortunately, I could not find any information on lazy_t on
the web. My questi
