blue storm wrote:
>
>
> 1) your field of research is "automatic program generation to solve a 
> set of given tasks" : you generate random programs in a given 
> language, with a mathematic theory giving you probability distribution 
> for various syntaxic elements, until you find one that achieve your 
> goal. You have a "learning mechanism" that can reuse previous solution 
> (such as declared functions) for helping further tasks
>
> 2) You generate Scheme program fragments
>
> 3) Your algorithm/generator is written in OCaml, using the ocs Ocaml 
> Scheme interpreter to test your generated programs
>
> 4) You would like to generate OCaml program fragments instead of 
> Scheme. Your idea is that the type system, imposing more constraints 
> on the legal program, will reduce the search space and accelerate your 
> generator.

If this description is correct (I haven't followed the whole discussion) 
then check out the adate system, which generates programs
in a subset of SML:

http://www-ia.hiof.no/~rolando/

-- eliot