Article
Full entry |
PDF
(0.2 MB)
Feedback
PDF
(0.2 MB)
Feedback
Keywords:
strong functor; strong monad; many-sorted set
strong functor; strong monad; many-sorted set
Summary:
We show that, on a category of many-sorted sets, the only functors that admit a cartesian strength are those that are given componentwise.
References:
[1] Adámek J., Trnková V.: Initial algebras and terminal coalgebras in many-sorted sets. Math. Structures Comput. Sci. 21 (2011), no. 2, 481–509. DOI 10.1017/S0960129510000502 | MR 2784610
[2] Kock A.: Strong functors and monoidal monads. Arch. Math. (Basel) 23 (1972), 113–120. DOI 10.1007/BF01304852 | MR 0304456
[3] Moggi E.: Notions of computation and monads. Selections from the 1989 IEEE Symposium on Logic in Computer Science, Inform. Computat. 93 (1991), no. 1, 55–92. MR 1115262
[4] Trnková V.: Some properties of set functors. Comment. Math. Univ. Carolinae 10 (1969), 323–352. MR 0252474
Search
Partner of
