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:
“Chicago—is—oh well a façade of skyscrapers facing a lake, and behind the façade every type of dubiousness.”
—E.M. (Edward Morgan)
“The pursuit of Fashion is the attempt of the middle class to co-opt tragedy. In adopting the clothing, speech, and personal habits of those in straitened, dangerous, or pitiful circumstances, the middle class seeks to have what it feels to be the exigent and nonequivocal experiences had by those it emulates.”
—David Mamet (b. 1947)