Version française
Home     About     Download     Resources     Contact us    
Browse thread
Re: [Caml-list] recursive or loop
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Thomas Fischbacher <Thomas.Fischbacher@P...>
Subject: Re: [Caml-list] recursive or loop

On Wed, 8 Mar 2006, Till Varoquaux wrote:

> I beleive specifying Marshal.Closures when marshalling should do the trick...

Have you ever tried this with production code? Say, from the toplevel? 
Marshalling Closures is severely limited (aside from the fact that the 16 
MB string length often hits badly when one tries to marshal closures).

I would not recommend it.

-- 
regards,               tf@cip.physik.uni-muenchen.de              (o_
 Thomas Fischbacher -  http://www.cip.physik.uni-muenchen.de/~tf  //\
(lambda (n) ((lambda (p q r) (p p q r)) (lambda (g x y)           V_/_
(if (= x 0) y (g g (- x 1) (* x y)))) n 1))                  (Debian GNU)