Hi Everybody,<div><br></div><div>I have a function which computes a fixed point in terms of iterate:</div><div><br></div><div><div><font class="Apple-style-span" face="&#39;courier new&#39;, monospace">equivalenceClosure :: (Ord a) =&gt; Relation a -&gt; Relation a</font></div>
<div><font class="Apple-style-span" face="&#39;courier new&#39;, monospace">equivalenceClosure = fst . List.head                -- &quot;guaranteed&quot; to exist </font></div><div><font class="Apple-style-span" face="&#39;courier new&#39;, monospace">                   . List.dropWhile (uncurry (/=))  -- removes pairs that are not equal</font></div>
<div><font class="Apple-style-span" face="&#39;courier new&#39;, monospace">                   . U.List.pairwise (,)            -- applies (,) to adjacent list elements</font></div><div><font class="Apple-style-span" face="&#39;courier new&#39;, monospace">                   . iterate ( reflexivity</font></div>
<div><font class="Apple-style-span" face="&#39;courier new&#39;, monospace">                             . symmetry</font></div><div><font class="Apple-style-span" face="&#39;courier new&#39;, monospace">                             . transitivity</font></div>
<div><font class="Apple-style-span" face="&#39;courier new&#39;, monospace">                             )</font></div><div> </div></div><div>Can this function be written in terms of fix?  It seems like there should be a transformation from this scheme to something with fix in it, but I don&#39;t see it.</div>
<div><br></div>