I am looking for small ML examples (using variants, modules, objects, 
etc ...)

Where one needs to write type information to be able to type-check the 
program with OCaml

I am developping a new typing algorithm (not unification based ;-) which 
seems to accept all OCaml features and more (like higher-order type 
without using a functor) with no type annotation at all. I have quite a 
few examples, but all the experts on this list may have idea I did not have.

Christophe Raffalli

PS: an article and a first implementation should be available very soon.