[P2] ================================================ AMAST Links 02 04

                 Type inference with record-subtyping?
              by _Jens Palsberg_ <palsberg@daimi.aau.dk>

   The up-to-date _full record of the discussion_ about this question
   in the Types Forum is available as a plain-text file at URL:
   http://www.cs.utwente.nl/data/amast/links/v02/i04/full/AC0204P2.txt

  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.