On the Smyth power domain
This paper explores the connection between the Smyth power domain PS(D) of a domain D and the domain D itself. The Smyth power domain is the most prevalent of the three power domain constructions commonly used to model nondeterminism in the denotational semantics of high-level programming languages. One definition of the Smyth power domain PS(D) is as the set of all Lawson-closed upper sets X from the domain D, so there is the natural inclusion x ↦↑x: D → PS(D). On the other hand, the inf map X ↦ ∧ X: PS(D) → D is an upper adjoint to this inclusion, and we use this adjunction to obtain information about PS(D) from the domain D. If D is distributive, spectral theory implies that each element X of PS(D) satisfies ∧ X is the infimum of a unique set of primes minimal with respect to being contained in X. Results which characterize when a domain D does not contain a copy of 2N are invoked to show that the set of such primes is finite in certain cases. We indicate how these results can be generalized to the case that D is locally distributive or semiprime. Our results are motivated by an interest in understanding the Smyth power domain PS(D) in terms of the domain D, and we feel they should have application to the semantics of high-level programming languages. An indication of some possible applications of these results is given at the end of the paper.
KeywordsFinite Subset Finite Breadth Deterministic Process Continuous Lattice Denotational Semantic
Unable to display preview. Download preview PDF.
- [Ber78]Berry, G., Stable models of the typed λ-Calculi, Lecture Notes in Computer Science 62 (1978), Springer-Verlag, 72–89.Google Scholar
- [BR]Brookes, S. D. and A. W. Roscoe, An improved failures model for communicating processes, Lecrture Notes in Computer Science 197 (1985), Springer-Verlag, 281–305.Google Scholar
- [Co88]Coquand, T., C. Gunter and G. Winskel, DI-domains as models for polymorphism, This Volume.Google Scholar
- [Gie77]Gierz, G. and K. Keimel, A lemma on primes appearing in algebra and analysis, Houston Journal of Mathematics 3 (1977), 207–224.Google Scholar
- [Gie80]Gierz, G., K. H. Hofmann, K. Keimel, J. D. Lawson, M. Mislove and D. Scott, A Compendium of Continuous Lattices, Springer-Verlag, Berlin, Heidelberg and New York (1980), 371 pp.Google Scholar
- [Gie85]Gierz, G., J. D. Lawson and A. R. Stralka, Intrinsic topologies for semilattices of finite breadth, Semigroup Forum 31 (1985), 1–18.Google Scholar
- [Grä68]Grätzer, G., Universal Algebra, D. van Nostrand, Toronto (1968), 368 pp.Google Scholar
- [Hof74]Hofmann, K. H., M. Mislove and A. R. Stralka, The Pontryagin Duality of Compact 0-Dimensional Semilattices and Its Applications, Lecture Notes in Mathematics 396 (1974), Springer-Verlag, 122 pp.Google Scholar
- [Liu83]Liukkonen, J. R. and M. Mislove, Measure algebras of locally compact semilattices, Lecture Notes in Mathematics 998 (1983), Springer-Verlag, 202–214.Google Scholar
- [Old86]Olderog, E.-R. and C. A. R. Hoare, Specification-oriented semantics for communicating sequential processes, Acta Informatica 23 (1986), 9–66.Google Scholar
- [Smy82]Smyth, M. B., Power domains and predicate transformers: a topological view, Lecture Notes in Computer Science 154 (1982), Springer-Verlag, 662–675.Google Scholar