Type Classes in Haskell

ACM Transactions on Programming Languages and Systems

Volumn 18, Issue 2, 1996, Pages 109-138

  Hall, Cordelia V ^a   Hammond, Kevin ^a   Peyton Jones, Simon L ^a   Wadler, Philip L ^a  

^a UNIVERSITY OF GLASGOW   (United Kingdom)

Author keywords

D.1.1 Programming Techniques : Language Classifications applicative languages; F.3.3 Logics and Meanings of Programs : Studies of Program Constructs type structure; Functional programming; Haskell; Languages; Theory; Type classes; Types

Indexed keywords

COMPUTER SOFTWARE; LOGIC PROGRAMMING;

FUNCTIONAL PROGRAMMING LANGUAGE HASKELL; HINDLEY-MILNER INFERENCE RULES; SECOND ORDER LAMBDA CALCULUS; TRANSFORMED PROGRAM; TYPE CLASSES;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0030103375     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/227699.227700     Document Type: Article

References (39)

1. AUGUSTSSON, L. 1993. Implementing Haskell overloading. In Proceedings of the 1993 Conference on Functional Programming and Computer Architecture (Copenhagen, Denmark). ACM, New York, 65-73.
2. BLOTT, S. 1991. Type classes. Ph.D. thesis, Dept. of Computing Science, Glasgow Univ., Glasgow, Scotland.
3. CARDELLI, L. 1987. Basic polymorphic typechecking. Sci. Comput. Program. 8, 147-172.
4. CHEN, K. 1994. Semantics and coherence for parametric type classes. Res. Rep., YALEU/DCS/RR-1003, Dept. of Computer Science, Yale Univ., New Haven, Conn. June.
5. CHEN, K. 1995. A parametric extension of Haskell's type classes. Ph. D. thesis, Dept. of Computer Science, Yale Univ., New Haven, Conn.
6. CHEN, K., HUDAK, P., AND ODERSKY, M. 1992. Parametric type classes. In Proceedings of the 1992 ACM Conference on Lisp and Functional Programming. ACM, New York, 170-181.
7. CORMACK, G. V. AND WRIGHT, A. K. 1990. Type dependent parameter inference. In Proceedings of the 1990 ACM Conference on Programming Language Design and Implementation (White Plains, N.Y.), ACM. New York, 127-136.
8. GIRARD, J.-Y. 1972. Interprétation functionelle et élimination des coupures dans l'arithmétique d'ordre supérieure. Thèse de doctorat d'état, Université Paris VII, Paris, France.
9. HAMMOND, K. 1991. Efficient type inference using monads. In 1991 Glasgow Workshop on Functional Programming (Ullapool, Scotland). Workshops in Computing Science, Springer-Verlag, Berlin, 146-157.
10. HAMMOND, K. 1993. Extended type classes, Int. Memo., Dept. of Computer Science, Glasgow Univ., Glasgow, Scotland.
11. HAMMOND, K. AND BLOTT, S. 1989. Implementing Haskell type classes. In 1989 Glasgow Workshop on Functional Programming (Fraserburgh, Scotland). Workshops in Computing Science, Springer-Verlag, Berlin, 266-286.
12. HINDLEY, R. 1969. The principal type scheme of an object in combinatory logic. Trans. Am. Math. Soc. 146, 29-60.
13. HUDAK, P., PEYTON JONES, S. L., AND WADLER, P.L., Eds., 1992. Report on the programming language Haskell, version 1.2. ACM SIGPLAN Not. 27, 5.
14. HUET, G., Ed.. 1990. Logical Foundations of Functional Programming. Addison-Wesley, Reading, Mass.
15. JONES, M. P. 1992a. A theory of qualified types. In Proceedings of the 1992 European Symposium on Programming (Rennes, France). Lecture Notes in Computer Science, vol. 582. Springer-Verlag, Berlin.
16. JONES, M.P. 1992b. A theory of qualified types. D.Phil. thesis, Programming Research Group, Oxford Univ., Oxford, England. Published by Oxford University Press, 1994.
17. JONES, M. P. 1992c. Efficient implementation of type class overloading. Int. Memo., Programming Research Group, Oxford Univ., Oxford, England.
18. JONES, M.P. 1993. Partial Evaluation for dictionary-free overloading. Res. Rep., YALEU/DCS/RR-959, Dept. of Computer Science, Yale Univ., New Haven, Conn. Apr.
19. JONES, M. P. 1994. Simplifying and improving qualified types. Res. Rep., YALEU/DCS/RR-1040, Dept. of Computer Science, Yale Univ., New Haven, Conn. June.
20. JONES, M. P. 1995. A system of constructor classes: Overloading and implicit higher-order polymorphism. J. Func. Program. 5, 1, 1-37.
21. KAES, S. 1988. Parametric polymorphism. In Proceedings of the 1988 European Symposium on Programming (Nancy, France). Lecture Notes in Computer Science, vol. 300. Springer-Verlag, Berlin.
22. LÄUFER, K. 1992. Polymorphic type inference and abstract data types. Ph.D. thesis, New York Univ., New York.
23. LÄUFER, K. 1993. An extension of Haskell with first-class abstract types. Tech. Rep., Loyola Univ. Chicago, Ill.
24. LÄUFER, K. AND ODERSKY, M. 1994. Polymorphic type inference and abstract data types. ACM Trans. Program. Lang. Syst. 16, 5, 1411-1430.
25. MILNER, R. 1978. A theory of type polymorphism in programming. J. Comput. Syst. Sci. 17, 348-375.
26. MILNER, R., TOFTE, M., AND HARPER, R. 1990. The Definition of Standard ML. MIT Press, Cambridge, Mass.
27. MILNER, R. AND TOFTE, M. 1991. Commentary on Standard ML. MIT Press, Cambridge, Mass.
28. NIPKOW, T. AND PREHOFER, C. 1993. Type checking type classes. In Proceedings of the 20th ACM Symposium on Principles of Programming Languages. ACM, New York, 409-418.
29. NIPKOW, T. AND SNELTING, G. 1991. Type classes and overloading resolution via order-sorted unification. In Proceedings of the 1991 Conference on Functional Programming Languages and Computer Architecture (Boston, Mass.). Lecture Notes in Computer Science, vol. 523. Springer-Verlag, Berlin, 1-14.
30. ODERSKY, M. AND LÄUFER, K. 1991. Type classes are signatures of abstract types. Tech. Rep., IBM T.J. Watson Research Center, Yorktown Heights, N.Y. May.
31. PEYTON JONES, S. L. 1987. The Implementation of Functional Programming Languages. Prentice-Hall International, Englewood Cliffs, N.J.
32. PEYTON JONES, S.L. AND WADLER, P.L. 1991. A static semantics for Haskell. Int. Memo., Dept. of Computing Science, Glasgow Univ., Glasgow, Scotland.
33. REYNOLDS, J. C. 1974. Towards a theory of type structure. In Proceedings of the Colloque sur la Programmation. Lecture Notes in Computer Science, vol. 19. Springer-Verlag, Berlin, 408-425.
34. REYNOLDS, J. C. 1985. Three approaches to type structure. In Mathematical Foundations of Software Development. Lecture Notes in Computer Science, vol. 185. Springer-Verlag, Berlin, 97-138.
35. ROUAIX, F. 1990. Safe run-time overloading. In Proceedings of the 17th ACM Symposium on Principles of Programming Languages (San Francisco, Calif.). ACM, New York, 355-366.
36. TURNER, D. A. 1985. Miranda: A non-strict functional language with polymorphic types. In Proceedings of the 1985 Conference on Functional Programming Languages and Computer Architecture (Nancy, France). Lecture Notes in Computer Science, vol. 201. Springer-Verlag, Berlin, 1-16.
37. VOLPANO, D. M. AND SMITH, G. S. 1991. On the complexity of ML typability with overloading. In Proceedings of the 1991 Conference on Functional Programming Languages and Computer Architecture (Boston, Mass.). Lecture Notes in Computer Science, vol. 523. Springer-Verlag, Berlin, 15-28.
38. WADLER, P. L. 1992. The essence of functional programming. In Proceedings of the 19th ACM Sympotium on Principles of Programming Languages (Albuquerque, N.M.). ACM, New York, 1-14.
39. WADLER, P. L. AND BLOTT, S. 1989. How to make ad-hoc polymorphism less ad hoc. In Proceedings of the 16th ACM Sympotium on Principles of Programming Languages (Austin, Tex.). ACM, New York, 60-76.