In computer science, a type class is a type system construct that supports ad-hoc polymorphism. This is achieved by adding constraints to type variables in parametrically polymorphic types. Such a constraint typically involves a type class T and a type variable a, and means that a can only be instantiated to a type whose members support the overloaded operations associated with T.
Type classes first appeared in the Haskell programming language, and were originally conceived as a way of implementing overloaded arithmetic and equality operators in a principled fashion. In contrast with the "eqtypes" of Standard ML, overloading the equality operator through the use of type classes in Haskell does not require extensive modification of the compiler frontend or the underlying type system.
Since their creation, many other applications of type classes have been discovered.
Read more about Type Class: Overview, Higher-kinded Polymorphism, Multi-parameter Type Classes, Functional Dependencies, Other Approaches To Operator Overloading, Related Notions
Famous quotes containing the words type and/or class:
“To put it rather bluntly, I am not the type who wants to go back to the land; I am the type who wants to go back to the hotel.”
—Fran Lebowitz (b. 1951)
“Mankind divides itself into two classes,—benefactors and malefactors. The second class is vast, the first a handful.”
—Ralph Waldo Emerson (1803–1882)