DI-domains as information systems
This paper introduces stable information systems. Stable information systems determine dI-domains and stable approximable mappings give stable functions, and vice versa. The notion of rigid embedding is captured by a subsystem relation. Under this relation, stable information systems form a cpo. Constructions like lifting, sum, product and function space are proposed which induce continuous functions on the cpo. In this way recursive stable information systems can be defined using fixed point theory.
Unable to display preview. Download preview PDF.
- [Be78]Berry, G., Stable models of typed λ-calculi, LNCS 62 (1978)Google Scholar
- [Gi87]Girard, Jean-Yves, Linear logic, Theoretical Computer Science 50 (1987)Google Scholar
- [KaPl78]Kahn, G., Plotkin, G., Domaines concretes, Rapport INRIA Laboria No. 336 (1978)Google Scholar
- [LaWi84]Larsen, K., Winskel, G., Using information systems to solve recursive domain equations effectively, LNCS 173 (1984)Google Scholar
- [Ma71]Maclane, S., Categories for the working mathematician, Springer-Verlag (1971)Google Scholar
- [NPW81]Nielsen, M., Plotkin, G., Winskel, G., Petri nets, event structures and domains, pert 1, Theoretical Computer Science 13 (1981)Google Scholar
- [Sc82]Scott, D. S., Domains for denotational semantics, LNCS 140 (1982)Google Scholar
- [Wi86]Winskel, G., Event structures, LNCS 255 (1986)Google Scholar
- [Wi88]Winskel, G., Event structures, Rex-summer school: Research and Education in Concurrency, Holland (1988)Google Scholar
- [Zh89a]Zhang, G. Q., DI-domains as Informations systems, Technical Report of Computer Science Department, Aarhus University, Denmark (1989)Google Scholar
- [Zh89b]Zhang, G. Q., Logics of Domains, PhD thesis, University of Cambridge (1989)Google Scholar