Type class approach seems quite a novel strategy. Using monoids, groups, rings, etc for algebraic structures in type class (interface), one can model operator overloading, collection literals, type conversions. Seems people in Haskell have been enjoying a lot.
No comments yet.