[
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: | 2002-05-21 (21:06) |
From: | YAMAGATA yoriyuki <yoriyuki@m...> |
Subject: | Re: [Caml-list] Surreal-0.0.3 |
From: Markus Mottl <markus@oefai.at> Subject: Re: [Caml-list] Surreal-0.0.3 Date: Thu, 16 May 2002 19:03:47 +0200 > The only problem of such a library might be its efficiency... A pioneer work by Böhm et al shows that a naive approach using functions as reals achieves better performance than a lazy approach (at least the one using infinite n-base expansion). The main point of Surreal is performance. (So, I don't use lazy approaches.) I tried some idea to boost performance for large scale computation. Another reason I was discouraged is that I don't know how to show the performance improvement. I hope someone who has experience with numerical computation looks my idea and judges whether it is useful. Yet another problem I have encountered is memory exhaustion. In my experiment, memory is major limitation (rather time). caml lazy construct always memorizes values, so one may encounter a similar problem. Haskel or other lazy languages may have better space efficiency, though. That's my thought. -- Yamagata Yoriyuki http://www.mars.sphere.ne.jp/yoriyuki/ ------------------- To unsubscribe, mail caml-list-request@inria.fr Archives: http://caml.inria.fr Bug reports: http://caml.inria.fr/bin/caml-bugs FAQ: http://caml.inria.fr/FAQ/ Beginner's list: http://groups.yahoo.com/group/ocaml_beginners