A Down newtype in Data.Ord?

[Sjoerd Visscher]

Desc has the same problem as Down: it doesn't make clear that it makes an already descending ordering ascending.

Sjoerd

On Nov 19, 2011, at 7:48 PM, Edward Kmett wrote:

> The problem Dual is taken by Data.Monoid. With Opposite it isn't clear what is being inverted as well. Perhaps Desc (or Descending)?
> 
> That would permit nice descriptions when used with the extended list comprehension sugar.
> 
> Sent from my iPad
> 
> On Nov 19, 2011, at 7:28 AM, Herbert Valerio Riedel <hvr at gnu.org> wrote:
> 
>> On Sat, 2011-11-19 at 12:07 +0100, Sjoerd Visscher wrote:
>>> I like the concept, but not the name. Inverse (or Inv) would be a better name imho.
>> 
>> btw, doesn't that "Down" transform the Ord relation into its "dual" (in
>> the category sense)? If so, wouldn't a categorical term like "Dual" or
>> "Opposite" (as in "Opposite Category") be more appropriate (given that
>> Haskell libraries already recycles many categorical terms?)
>> 
>> Just saying... :-)
>> 
>> -- hvr.
>> 
>> 
>> _______________________________________________
>> Libraries mailing list
>> Libraries at haskell.org
>> http://www.haskell.org/mailman/listinfo/libraries
>