Skip to main content
SpringerLink
Log in

Type inference and type classes

  • Conference paper
Book cover Functional Programming

Part of the book series: Workshops in Computing ((WORKSHOPS COMP.))

Abstract

Type classes were developed in association with the lazy functional programming language Haskell [1] to handle overloading since no satisfactory off-the-shelf solution was available. The motivation and description of type classes is given in [2].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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 

  2. 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 

  3. R. Hindley, The principal type scheme of an object in combinatory logic. In Trans. Am. Math. Soc. 146, pp. 29–60, December 1969.

    MATH  MathSciNet  Google Scholar 

  4. R. Milner, A theory of type polymorphism in programming. In J. Comput. Syst. Sci. 17, pp. 348–375, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  5. 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 

  6. Luca Cardelli, Basic polymorphic typechecking, Computing Science tech. report 119, AT and T Bell laboratories, Murray Hill, NJ, 1984.

    Google Scholar 

  7. Kevin Hammond, De-Mysticifying type classes, in Proceedings of the 2nd Glasgow FP group workshop, Fraserburgh, Scotland, 1989.

    Google Scholar 

  8. S. Blott, Thesis, Computing Science Dept., University of Glasgow, (in preparation).

    Google Scholar 

  9. L. Damas, Type assignment in programming languages, Thesis, University of Edinburgh, 1985.

    Google Scholar 

  10. J. A. Robinson, A machine orientated logic based on the resolution principal. JACM 12, 1, pp. 23–41, 1965.

    Article  MATH  Google Scholar 

  11. 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 

Download references

Author information

Authors and Affiliations

  1. Department of Computing Science, University of Glasgow, UK

    Stephen Blott

Authors
  1. Stephen Blott
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing Science, University of Glasgow, Glasgow, G12 8QQ, Scotland

    Kei Davis MSc  & John Hughes BA, DipCompSci, DPhil  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1990 British Computer Society

About this paper

Cite this paper

Blott, S. (1990). Type inference and type classes. In: Davis, K., Hughes, J. (eds) Functional Programming. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3166-3_17

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-3166-3_17

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-19609-9

  • Online ISBN: 978-1-4471-3166-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation