Previous |  Up |  Next

Article

Title: Strong functors on many-sorted sets (English)
Author: Levy, Paul B.
Language: English
Journal: Commentationes Mathematicae Universitatis Carolinae
ISSN: 0010-2628 (print)
ISSN: 1213-7243 (online)
Volume: 60
Issue: 4
Year: 2019
Pages: 533-540
Summary lang: English
.
Category: math
.
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. (English)
Keyword: strong functor
Keyword: strong monad
Keyword: many-sorted set
MSC: 18A22
idZBL: Zbl 07177888
idMR: MR4061361
DOI: 10.14712/1213-7243.2019.029
.
Date available: 2020-02-10T16:49:55Z
Last updated: 2022-01-03
Stable URL: http://hdl.handle.net/10338.dmlcz/147974
.
Reference: [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. MR 2784610, 10.1017/S0960129510000502
Reference: [2] Kock A.: Strong functors and monoidal monads.Arch. Math. (Basel) 23 (1972), 113–120. MR 0304456, 10.1007/BF01304852
Reference: [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
Reference: [4] Trnková V.: Some properties of set functors.Comment. Math. Univ. Carolinae 10 (1969), 323–352. MR 0252474
.

Files

Files Size Format View
CommentatMathUnivCarolRetro_60-2019-4_8.pdf 274.2Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo