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:
“Music, in performance, is a type of sculpture. The air in the performance is sculpted into something.”
—Frank Zappa (1940–1994)
“Alas for the cripple Practice when it seeks to come up with the bird Theory, which flies before it. Try your design on the best school. The scholars are of all ages and temperaments and capacities. It is difficult to class them, some are too young, some are slow, some perverse. Each requires so much consideration, that the morning hope of the teacher, of a day of love and progress, is often closed at evening by despair.”
—Ralph Waldo Emerson (1803–1882)