Dear OCaml hackers,

we are about to do an exact symbolic calculation of enormous size (it 
could even be the largest one performed by mankind so far, I don't know) 
which comes from superstring theory. We do this in Ocaml, using as much 
of the algebraic structure as possible, and hence implemented quite many 
algorithmic tricks in the code which give us a performance boost of a 
factor of about 300 over the already highly optimized but more generic 
"symbol cruncher" FORM term manipulation program.

We might have an opportunity to use the supercomputer of a german plasma 
physics research institution for this, but this particular machine runs 
AIX on PowerPCs, _probably_ with somewhat out-dated software on it, so I
suppose I would have quite a hard time installing an ocaml compiler on it.

Hence, before I write an application for computing resources on that 
machine, I'd like to ask if there is anyone out there who could compile 
my code for AIX (needs ocaml 2.07.2a and libnums-ocaml 3.07)?

-- 
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)

-------------------
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