Re: I need some help
However the user of the program give some argument then program is starting. And I want to use this arguments for example at the end of the program. What will I do. Good question. I've had a bad time with this, some in this list proably got tired of me saying the same thing over and over again... those of you might want to skip the rest of my mail :-) huh? what is this line doing here.. I thought I had cut/pasted it below, but instead I copy/pasted it (then changed it). Most of the is pretty readble, I just complain about stuff in the last part of the e-mail :-) J.A. ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
Is there a name for this structure?
Not really a Haskell question, but someone here might know the answer... Suppose you have two morphisms f : A - B and g : B - A such that neither (f . g) nor (g . f) is the identity, but satisfying (f . g . f) = f. Is there a conventional name for this? Alternately, same question, but f and g are functors and A and B categories. In some cases (g . f . g) is also equal to g; is there a name for this as well? I find myself running into pairs of functions with this property over and over again, and am looking for a short way to describe the property... Thanks, --Joe English [EMAIL PROTECTED] ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
Is there a name for this structure?
Joe English writes: : | Suppose you have two morphisms f : A - B and g : B - A | such that neither (f . g) nor (g . f) is the identity, | but satisfying (f . g . f) = f. Is there a conventional name | for this? Is it equivalent to saying that (f . g) is the identity on the range of f? That's shorter, though still not a snappy single word term. ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell-cafe
