the alphabetical ordering on Symbol is already exposed via TypeLits... this would be some machinery to help maintain that ordering with less user intervention?
On Thu, Oct 16, 2014 at 6:59 PM, Barney Hilken <b.hil...@ntlworld.com> wrote: > I can think of a use for a non-equality constraint: an alphabetical > ordering on Symbol. This would allow experimental implementations of > extensible records (without shadowing) which keep the labels sorted. > > An order constraint on Nat might be useful, too. > > Barney. > > _______________________________________________ > Glasgow-haskell-users mailing list > Glasgow-haskell-users@haskell.org > http://www.haskell.org/mailman/listinfo/glasgow-haskell-users >
_______________________________________________ Glasgow-haskell-users mailing list Glasgow-haskell-users@haskell.org http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
