[P3] ================================================ AMAST Links 02 04

               Typing with set of most general unifiers
             by _Simon Courtenage_ <simonc@dcs.kcl.ac.uk>

   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/AC0204P3.txt

  I would like to find out if there has been any work done on type
inference algorithms using a finite set of most general unifiers
rather than a single mgu.  While I'm sure that I've never seen or
heard of any, and that the problem itself seems difficult at best, I
would just like to make sure.

Thank you.

Simon Courtenage : http://www.dcs.kcl.ac.uk/staff/simonc/simon.html