Type inference with record-subtyping?

   Consider a typed lambda-calculus with records.  
Suppose that the record types are ordered by a 
subtyping relation, and suppose that there is a 
subsumption rule.   The question of type inference 
is to decide if a given unannotated program is typable.  
Which papers are published about type inference
problems of this form?  

Please send replies to me.  If there is sufficient 
interest, I will send a summary to the types list.

Jens Palsberg

Computer Science Department
Aarhus University
DK-8000 Aarhus C

E-mail:  palsberg@daimi.aau.dk