Polymorphic type inference with overloading and subtyping Conference

Smith, GS. (1993). Polymorphic type inference with overloading and subtyping . Lecture Notes in Computer Science, 668 LNCS 671-685. 10.1007/3-540-56610-4_97

cited authors

  • Smith, GS

abstract

  • We show how the Hindley/Milner polymorphic type system can be extended to incorporate overloading and subtyping, by using constrained quantification. We describe an algorithm for inferring principal types and outline a proof of its soundness and completeness. We find that it is necessary in practice to simplify the inferred types, and we describe techniques for type simplification that involve shape unification, strongly connected components, transitive reduction, and the monotonicities of type formulas.

authors

publication date

  • January 1, 1993

published in

Digital Object Identifier (DOI)

start page

  • 671

end page

  • 685

volume

  • 668 LNCS