Browse thread
Re: [Caml-list] recursive or loop
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: | 2006-03-08 (21:56) |
From: | Thomas Fischbacher <Thomas.Fischbacher@P...> |
Subject: | Re: [Caml-list] recursive or loop |
On Wed, 8 Mar 2006, Matthew O'Connor wrote: > > No it does not. But never mind. It would not help either. > > Doesn't CPS enable you to basically keep the entire call stack (or > equivalent) in the heap? Yes, it does. > Can you explain why it wouldn't help? Thanks. You still would have to write out a closure if you want to write all the state to disk. -- 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)