mind you, i'm not sure what the ordering is specified to be :) On Thu, Oct 16, 2014 at 9:24 PM, Carter Schonwald < carter.schonw...@gmail.com> wrote:
> http://hackage.haskell.org/package/base-4.7.0.1/docs/GHC-TypeLits.html > > type family CmpSymbol m n :: Ordering > <http://hackage.haskell.org/package/base-4.7.0.1/docs/Data-Ord.html#t:Ordering> > > On Thu, Oct 16, 2014 at 7:14 PM, Barney Hilken <b.hil...@ntlworld.com> > wrote: > >> Ok, I hadn't realised that. Looking in the user's guide, I see <= and <=? >> for Nat, but I couldn't find anything about Symbol. I must try them out! >> >> >> > From: Carter Schonwald <carter.schonw...@gmail.com> >> > >> > 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
