Re: Question: typing with set of most general unifiers

Simon Courtenage asks:

    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. 

Satish Thatte has worked on the problem. Here's a bibtex entry of a
paper that appeared in FPCA'93:

  author = 	"Satish R. Thatte",
  title = 	"Coercive Type Isomorphism",
  booktitle = 	"Proceedings Functional Programming Languages and Computer
		 Architecture, 5th {ACM} Conference, Cambridge, {MA},
  year = 	"1991",
  editor = 	"John Hughes",
  publisher = 	"Springer-Verlag",
  month = 	"August",
  note = 	"Lecture Notes in Computer Science 523",
  pages = 	"29--49"


-- Martin 


Prof. Martin Odersky			 	 odersky@ira.uka.de
Department of Computer Science			 Tel. +49 721 608 3495
University of Karlsruhe				 Fax  +49 721 69 40 92
76128 Karlsruhe, Germany

C is the ultimate computer virus (Dick Gabriel)