Australasian Computer Science Conference (2000)
Jan. 31, 2000 to Feb. 3, 2000
David Jeffery , University of Melbourne
Fergus Henderson , University of Melbourne
Zoltan Somogyi , University of Melbourne
The type systems of functional languages such as Haskell have recently become more powerful and expressive. They not only allow programmers to write code that works on values of any type (genericity), they also allow programmers to require that a particular type belongs to a given type class (constrained genericity). Such code may use any of the methods of the type class, since every type that is a member of the type class must implement those methods.This capability makes it significantly easier to express solutions to many common problems, and promotes code reuse. Incorporating type classes in a logic programming language provides some new challenges. In this paper, we explain how we have extended Mercury's type system to include support for type classes. We show that type classes integrate very nicely with Mercury's mode, determinism and uniqueness systems, and describe how our implementation works.
David Jeffery, Fergus Henderson, Zoltan Somogyi, "Type Classes in Mercury", Australasian Computer Science Conference, vol. 00, no. , pp. 128, 2000, doi:10.1109/ACSC.2000.824391