Hi, I found 'Typing Dynamic Typing' by Arthur Baars and Doaitse
Swierstra (http://www.cs.uu.nl/people/arthurb/dynamic.html) the other
day and am wondering if there is a trick to encode a universally
qualified type constructor. I.e. section 3 of the paper uses datatype 

Equal a b = forall f . f a -> f b

as a proof that types a and b are equal. Is there a transliteration of
this haskell into ocaml? Thanks - EA