Hostname: page-component-7dd5485656-glrdx Total loading time: 0 Render date: 2025-10-29T16:16:20.709Z Has data issue: false hasContentIssue false
  • English
  • Français

Some monoidal closed categories of stable domains and event structures

Published online by Cambridge University Press:  04 March 2009

Guo-Qiang Zhang
Guo-Qiang Zhang
Affiliation:
Artificial Intelligence Laboratory, Department of EECS, The University of Michigan, Ann Arbor, MI 48109
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper introduces the following new constructions on stable domains and event structures: the tensor product; the linear function space; and the exponential. These give rise to a monoidal closed category of dI-domains and to stable event structures, which can be used to interpret intuitionistic linear logic. Finally, the usefulness of the category of stable event structures for modeling concurrency and its relation to other models are discussed.

Information

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 3 , Issue 2 , June 1993 , pp. 259 - 276
Copyright
Copyright © Cambridge University Press 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Berry, G. (1978) Stable models of typed λ-calculi. Springer-Verlag Lecture Notes in Computer Science 62 72–88.CrossRefGoogle Scholar
Coquand, T. (1987) Two models of intuitionistic linear logic in posets, manuscript.Google Scholar
Girard, J.-Y. (1986) The system F of variable types, fifteen years later. Theoretical Computer Science 45 159–192.CrossRefGoogle Scholar
Girard, J.-Y. (1987) Linear Logic. Theoretical Computer Science 50 1–102.CrossRefGoogle Scholar
Girard, J.-Y. and Lafont, Y. (1986) Linear logic and lazy computation, manuscript.Google Scholar
Mac Lane, S. (1971) Categories for the working mathematician, Springer-Verlag.CrossRefGoogle Scholar
Milner, R. (1989) Communication and concurrency, Prentice Hall.Google Scholar
Marti-Oliet, N. and Meseguer, J. (1989) From Petri Nets to Linear Logic, manuscript.Google Scholar
Nielsen, M., Plotkin, G. and Winskel, G. (1981) Petri nets, event structures and domains, part 1. Theoretical Computer Science 13.CrossRefGoogle Scholar
Scott, D. (1982) Domains for denotational semantics. Springer-Verlag Lecture Notes in Computer Science 140 577–613.CrossRefGoogle Scholar
Seely, R. A. G. (1989) Linear logic, *-autonomous categories, and cofree coalgebras, Categories in Computer Science and Logic. Contemporary Mathematics 92 371–382.CrossRefGoogle Scholar
Winskel, G. (1987) Event structures. Springer-Verlag Lecture Notes in Computer Science 255 196–223.Google Scholar
Winskel, G. (1988) An introduction to event structures. Springer-Verlag Lecture Notes in Computer Science 354 364–397.CrossRefGoogle Scholar
Winskel, G. (1988) A monoidal closed category and its relation with categories for synchronizing processes, manuscript.Google Scholar
Zhang, G.-Q. (1989) DI-domains as information systems (ICALP-1989, Italy). Springer-Verlag Lecture Notes in Computer Science 372 773–788.CrossRefGoogle Scholar
Zhang, G.-Q. (1991) Logic of Domains, Birkhäuser, Boston.CrossRefGoogle Scholar
Zhang, G.-Q. (1992) DI-domains as prime information systems. Information and Computation 100 (2) 151–177.CrossRefGoogle Scholar