Type Class

Definitions

1. A Haskell construct that defines a set of functions that can be implemented for different types, enabling ad-hoc polymorphism. Similar to traits or interfaces but resolved at compile time through type inference.

   In plain English: A way in Haskell to say 'these types all support this operation' — like saying both numbers and strings can be compared for equality, but in different ways.

   Example: "The Eq type class lets you compare any two values of the same type for equality."

Related Terms

• Algebraic Data Type
• Cabal
• Category
• Currying
• Discriminated Union
• Effect System
• Forall
• Applicative Functor