Type inference and type classes
Type classes were developed in association with the lazy functional programming language Haskell  to handle overloading since no satisfactory off-the-shelf solution was available. The motivation and description of type classes is given in .
Unable to display preview. Download preview PDF.
- P. Hudak, and P. Wadler (editors), Report on the functional programming language Haskell, Technical report YALEU/DCS/RR656, Yale University, Department of Computer Science, November 1988.Google Scholar
- Phil Wadler and Stephen Blott, How to make ad-hoc polymorphism less ad hoc, In Proceedings of the 16’th Annual Symposium on Principles of Programming Languages, Austin, Texas, January 1989.Google Scholar
- L. Damas and R. Milner, Principal type schemes for functional programs. In Proceedings of the 9’th Annual Symposium on Principles of Programming Languages, Albuquerque, N.M., January 1982.Google Scholar
- Luca Cardelli, Basic polymorphic typechecking, Computing Science tech. report 119, AT and T Bell laboratories, Murray Hill, NJ, 1984.Google Scholar
- Kevin Hammond, De-Mysticifying type classes, in Proceedings of the 2nd Glasgow FP group workshop, Fraserburgh, Scotland, 1989.Google Scholar
- S. Blott, Thesis, Computing Science Dept., University of Glasgow, (in preparation).Google Scholar
- L. Damas, Type assignment in programming languages, Thesis, University of Edinburgh, 1985.Google Scholar
- V. Breazu, T. Coquand, C. A. Gunter, and S. Scedrov. Inheritance and explicit coercion (preliminary report), V. Breazu, Department of Computer and Information Sciences, University of Pensylvania, Philidelphia, PA 19104, USA. October 1988.Google Scholar