> correctly sorted lists under _all_ circunstances. This type signature > is much simpler than the actual sort - hence is useful. > > sort :: (HList l,HOrderedList l') => l -> l' > > Nice and readable, and much simpler than the actual algorithm (be > it bubble sort, or a quick sort)
The type signature you give is no different from sort :: (C1 l, C2 l') => l -> l' and conveys no more information. You should include the definitions of the classes before saying "this is much simpler than the actual sort". --KW 8-) _______________________________________________ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
