On Thu, Sep 23, 2010 at 4:46 PM, Edward Kmett <span dir="ltr"><<a href="mailto:ekmett@gmail.com">ekmett@gmail.com</a>></span> wrote:<br><div class="gmail_quote"><blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;">
<div bgcolor="#FFFFFF"><div>The biggest problem with splitting AddBounds is that the result is then not able to be Bounded as it only supplies one bound.</div></div></blockquote><div><br>Right. It would take both applications to be in Bounded. <br>
</div><blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;"><div bgcolor="#FFFFFF"><div><br></div><div>This defeats the purpose of constructing it, because now it cannot be composed with Min/Max.<br>
</div></div></blockquote><div><br>Yeah. For using in Min/Max we'd have to have Bounded, which is overkill, or a decomposition of Bounded, which probably makes more sense anyway but has the usual backward-compat issues.<br>
</div><blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;"><div bgcolor="#FFFFFF"><div><font color="#888888"><br>-Edward</font></div><div><div>
</div>
<div class="h5"><div><br>On Sep 23, 2010, at 7:20 PM, Conal Elliott <<a href="mailto:conal@conal.net" target="_blank">conal@conal.net</a>> wrote:<br><br></div><div></div><blockquote type="cite"><div>That extra bit bothered me, too. One could split AddBound into AddMax and AddMin. Perhaps better is to fix the problem upstream, splitting Bounded into WithMin and WithMax.<br>
<br><div class="gmail_quote">On Thu, Sep 23, 2010 at 3:46 PM, Ross Paterson <span dir="ltr"><<a href="mailto:ross@soi.city.ac.uk" target="_blank"></a><a href="mailto:ross@soi.city.ac.uk" target="_blank">ross@soi.city.ac.uk</a>></span> wrote:<br>
<blockquote class="gmail_quote" style="margin: 0pt 0pt 0pt 0.8ex; border-left: 1px solid rgb(204, 204, 204); padding-left: 1ex;"><div>On Thu, Sep 23, 2010 at 03:08:48PM -0400, Edward Kmett wrote:<br>
> On the other hand, composing AddBounds introduces another element on the other<br>
> side, which serves as an annihilator when composed with Min and Max. This is<br>
> fine for some applications, but I don't believe it subsumes MinPriority and<br>
> MaxPriority.<br>
<br>
</div>This extra element at the other end introduced by AddBounds bothers<br>
me too. So I agree with the conclusion that we need both versions that<br>
add a maximum/minimum, and ones that take it from Bounded. That leaves<br>
the question of which variant deserves to be called Max/Min.<br>
<div><div></div><div>_______________________________________________<br>
Libraries mailing list<br>
<a href="mailto:Libraries@haskell.org" target="_blank"></a><a href="mailto:Libraries@haskell.org" target="_blank">Libraries@haskell.org</a><br>
<a href="http://www.haskell.org/mailman/listinfo/libraries" target="_blank"></a><a href="http://www.haskell.org/mailman/listinfo/libraries" target="_blank">http://www.haskell.org/mailman/listinfo/libraries</a><br>
</div></div></blockquote></div><br>
</div></blockquote><blockquote type="cite"><div><span>_______________________________________________</span><br><span>Libraries mailing list</span><br><span><a href="mailto:Libraries@haskell.org" target="_blank">Libraries@haskell.org</a></span><br>
<span><a href="http://www.haskell.org/mailman/listinfo/libraries" target="_blank">http://www.haskell.org/mailman/listinfo/libraries</a></span><br></div></blockquote></div></div></div></blockquote></div><br>