ML Typing, Explicit Polymorphism and Qualified Types

  title={ML Typing, Explicit Polymorphism and Qualified Types},
  author={Mark P. Jones},
The ML type system was originally introduced as a means of identifying a class of terms in a simple untyped language, often referred to as core-ML, whose evaluation could be guaranteed not to “go wrong”. In subsequent work, the terms of core-ML have also been viewed as a ‘convenient shorthand’ for programs in typed languages. Notable examples include studies of ML polymorphism and investigations of overloading, motivated by the use of type classes in Haskell. In this paper, we show how… CONTINUE READING
9 Citations
25 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 25 references

Qualified types: Theory and Practice

  • M. P. Jones
  • D. Phil. Thesis
  • 1992
Highly Influential
6 Excerpts

Report on the programming language Haskell, version 1.2

  • P. Hudak, S. L. Peyton Jones, P. Wadler eds
  • ACM SIGPLAN notices,
  • 1992
Highly Influential
6 Excerpts

An approach to overloading with polymorphism

  • S. M. Blott
  • Ph.D. thesis, Department of computing science,
  • 1991
Highly Influential
5 Excerpts

From polymorphism to monomorphism by partial evaluation

  • M. P. Jones
  • Yale University,
  • 1993
1 Excerpt

Similar Papers

Loading similar papers…