论文信息 - Premonoidal categories and notions of computation

Premonoidal categories and notions of computation

We introduce the notions of premonoidal category and premonoidal functor, and show how these can be used in the denotational semantics of programming languages. We characterize the semantic definitions of Eugenio Moggi's monads as notions of computation, exhibit a representation theorem for our premonoidal setting in terms of monads, and give a fibrational setting for the structure.

Edmund Robinson | John Power | J. Power | E. Robinson

[1] G. M. Kelly,et al. A universal property of the convolution monoidal structure , 1986 .

[2] Claudio Hermida,et al. Fibrational Control Structures , 1995, CONCUR.

[3] Bart Jacobs,et al. Fibrations with Indeterminates: Contextual and Functional Completeness for Polymorphic Lambda Calculi , 1995, Math. Struct. Comput. Sci..

[4] Gordon D. Plotkin,et al. An axiomatisation of computationally adequate domain theoretic models of FPC , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[5] S. Lack,et al. Introduction to extensive and distributive categories , 1993 .

[6] Eugenio Moggi,et al. Notions of Computation and Monads , 1991, Inf. Comput..

[7] G. M. Kelly,et al. On MacLane's conditions for coherence of natural associativities, commutativities, etc. , 1964 .

[8] Robin Milner,et al. Control structures , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[9] A. J. Power,et al. A general coherence result , 1989 .

[10] John Power. Elementary Control Structures , 1996, CONCUR.

[11] Marcelo P. Fiore. Axiomatic domain theory in categories of partial maps , 1994 .

[12] John Power,et al. A Representable Approach to Finite Nondeterminism , 1997, Theor. Comput. Sci..