Decidable polymorphic recursion?


Does anybody know of any work on type systems which are somewhere in
between the Damas-Milner and the Milner-Mycroft calculus in strength? What
I am looking for is a type system for which we can infer the types but
still gives some kind of (but of course not full) polymorphic recursion.
Any pointers appreciated.