On Jun 29, 2004, at 6:46 PM, Iavor S. Diatchki wrote:
In Haskell, natural transformations are polymorphic functions, tau
:: f a - g a. For example, maybeToList :: Maybe a - [a].
actually i think this is a good approximation. not all polymorphic
functions are natural transformations, but simple
hello,
i was thinking of higher-order functions, which i think complicate things
(i might be wrong though :-)
for example:
fix :: (a - a) - a
is ploymorphic, but is it a natural tranformation?
i belive it is in fact a di-natural transformation.
-iavor
On Jun 29, 2004, at 6:46 PM, Iavor S. Diatchki
G'day all.
Quoting Iavor S. Diatchki [EMAIL PROTECTED]:
just a few silly remarks...
Not so silly...
actually i think this is a good approximation. not all polymorphic
functions are natural
transformations, but simple ones usually are.
I've found when studying category theory that
