[Haskell-cafe] a finite free category
Vasili I. Galchin
vigalchin at gmail.com
Thu Mar 24 00:30:53 CET 2011
I think that would be the case ...I would have to think. Should reflexive
and transitive operations I think on the finite graph (possibly with
On Wed, Mar 23, 2011 at 5:26 PM, Luke Palmer <lrpalmer at gmail.com> wrote:
> On Wed, Mar 23, 2011 at 3:58 PM, Vasili I. Galchin <vigalchin at gmail.com>
> > Hello,
> > Does there exist Haskell to generate a finite free category from a
> > finite multipath graph with loops?
> AKA the transitive closure of a graph?
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Haskell-Cafe