Type inference with record-subtyping?

• To: types@dcs.gla.ac.uk
• Subject: Type inference with record-subtyping?
• From: Jens Palsberg <jpalsberg@daimi.aau.dk>
• Date: Tue, 7 Mar 1995 14:53:54 +0100
• Approved: types@dcs.gla.ac.uk

Question:  
   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
Denmark

E-mail:  palsberg@daimi.aau.dk

• Prev: Categorical Models of Linear (and other) logics
• Next: Re: Categorical Models of Linear (and other) Logics
• Index(es):
  • Main
  • Thread