×

Premonoidal categories as categories with algebraic structure. (English) Zbl 1002.68089

We develop the study of premonoidal categories. Specifically, we reconcile premonoidal categories with the usual study of categories with algebraic structure by adding a little extra structure. We further give a notion of closedness for a premonoidal category with such extra structure, and show that every premonoidal category fully embeds into a closed one.

MSC:

68Q55 Semantics in the theory of computing
18B20 Categories of machines, automata
Full Text: DOI

References:

[1] Anderson, S. O.; Power, A. J., A representable approach to finite nondeterminism, Proc. MFPS ’94, Theoret. Comput. Sci., 177, 3-25 (1997) · Zbl 0901.68105
[2] Blackwell, R.; Kelly, G. M.; Power, A. J., Two-dimensional monad theory, J. Pure Appl. Algebra, 59, 1-41 (1989) · Zbl 0675.18006
[3] Fiore, M., Axiomatic domain theory in categories of partial maps (1996), Cambridge University Press Distinguished Dissertations in Computer Science: Cambridge University Press Distinguished Dissertations in Computer Science Cambridge · Zbl 0979.68549
[4] Bin Im, Guen; Kelly, G. M., A universal property of the convolution monoidal structure, J. Pure Appl. Algebra, 43, 75-88 (1986) · Zbl 0604.18004
[5] M. Hasegawa, Models of sharing graphs: a categorical semantics of let and letrec, Edinburgh University Thesis, 1997, ECS-LFCS-97-360 (to appear as a Distinguished Dissertation in Computer Science).; M. Hasegawa, Models of sharing graphs: a categorical semantics of let and letrec, Edinburgh University Thesis, 1997, ECS-LFCS-97-360 (to appear as a Distinguished Dissertation in Computer Science).
[6] K. Honda, N. Yoshida, Game theoretic analysis of call-by-value computation, Proc. ICALP 97, Lecture Notes in Computer Science, Vol. 1256, Springer, Berlin, 1997, pp. 225-236.; K. Honda, N. Yoshida, Game theoretic analysis of call-by-value computation, Proc. ICALP 97, Lecture Notes in Computer Science, Vol. 1256, Springer, Berlin, 1997, pp. 225-236. · Zbl 1401.68032
[7] Kelly, G. M., Basic concepts of enriched category theory, London Mathematical Society Lecture Notes Series, Vol. 64 (1982), Cambridge University Press: Cambridge University Press Cambridge · Zbl 0478.18005
[8] Kelly, G. M.; Power, A. J., Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads, J. Pure Appl. Algebra, 89, 163-179 (1993) · Zbl 0779.18003
[9] Mac Lane, S., Categories for the Working Mathematician (1971), Springer: Springer Berlin · Zbl 0232.18001
[10] Moggi, E., Notions of computation and monads, Inform. and Comput., 93, 55-92 (1991) · Zbl 0723.68073
[11] Mifsud, A.; Milner, R.; Power, A. J., Control structures, Proc. LICS, 95, 188-198 (1995)
[12] Power, A. J., Why tricategories?, Inform. Comput., 120, 251-262 (1995) · Zbl 0829.18003
[13] A.J. Power, Elementary control structures, Proc. CONCUR ’96: Concurrency Theory, Lecture Notes in Computer Science, 1996, Springer, Berlin, pp. 115-130.; A.J. Power, Elementary control structures, Proc. CONCUR ’96: Concurrency Theory, Lecture Notes in Computer Science, 1996, Springer, Berlin, pp. 115-130. · Zbl 1514.68181
[14] Power, A. J., Modularity in Denotational Semantics, Proc. MFPS 97, Electronic Notes in Theoretical Computer Science, 6 (1997)
[15] A.J. Power, E.P. Robinson, On the categorical semantics of types, Draft, 1995.; A.J. Power, E.P. Robinson, On the categorical semantics of types, Draft, 1995.
[16] Power, A. J.; Robinson, E. P., Premonoidal categories and notions of computation, Proc. LDPL ’96, Math Struct. Comput. Sci., 7, 453-468 (1997) · Zbl 0897.18002
[17] Power, A. J.; Thielecke, H., Environments, continuation semantics, and indexed categories, Proc. Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 1281 (1997), Springer: Springer Berlin · Zbl 0882.18007
[18] E. Robinson, Variations on algebra: monadicity and generalisations of algebraic theories, Math. Struct. Comput. Sci., to appear.; E. Robinson, Variations on algebra: monadicity and generalisations of algebraic theories, Math. Struct. Comput. Sci., to appear. · Zbl 1004.18005
[19] H. Thielecke, Continuation passing style and self-adjointness, Proc. 2nd ACM SIGPLAN Workshop on Continuations, BRICS Notes Series NS-96-13, 1996.; H. Thielecke, Continuation passing style and self-adjointness, Proc. 2nd ACM SIGPLAN Workshop on Continuations, BRICS Notes Series NS-96-13, 1996.
[20] Thielecke, H., Continuation semantics and self adjointness, Proc. MFPS 97, Electronic Notes in Theoretical Computer Science, 6 (1997)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.