On Friday 04 March 2011 03:24:34, Markus wrote: > What about having the order by diagonals, like: > > 0 1 3 > 2 4 > 5 > > and have none of the pair be bounded? >
I tacitly assumed product order (lexicographic order). _______________________________________________ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe
