|
|
|
|
|
|
| Synopsis |
|
|
|
|
| Closures
|
|
| reflClose :: Ord a => Rel a a -> Rel a a |
| Compute the reflective closure
|
|
| symmClose :: Ord a => Rel a a -> Rel a a |
| Compute the symmetric closure
|
|
| transClose' :: Ord a => Rel a a -> Rel a a |
| Compute the transitive closure (naive, slow)
|
|
| transClose :: Ord a => Rel a a -> Rel a a |
| Compute the transitive closure (faster)
|
|
| reflTransClose :: Ord a => Rel a a -> Rel a a |
| Compute the reflexive, transitive closure
|
|
| equiv :: Ord b => Rel b b -> Rel b b |
| Compute the reflexive, transitive, symmetric closure, i.e. the
induced equivalence relation.
|
|
| Produced by Haddock version 0.7 |
