Skip to main content
SpringerLink
Log in

Universal quasi-prime algebraic domains

Extended abstract

  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Programming Semantics (MFPS 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 802))

Abstract

This paper demonstrates the existence of a saturated quasi-prime algebraic domain. It also presents a cpo of quasi-prime generated information systems for solving domain equations.

On leave from Department of Computer Science, The University of Georgia, Athens, GA 30602

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Droste, M., and Göbel, R. Universal domains in the theory of denotational semantics of programming languages. Proc. of the IEEE 5th annual symposium on logic in computer science, 1990.

    Google Scholar 

  2. Droste, M., and Göbel, R. Universal information systems. International Journal of Foundations of Computer Science vol. 1, no. 4, 1991.

    Google Scholar 

  3. Gierz, G., Hofmann, K.H., Keimel, K., Lawson, J.D., Mislove, M., and Scott, D.S. A Compendium of Continuous Lattices. Springer-Verlag, 1980.

    Google Scholar 

  4. Gunter, C. Universal profinite domains. Information and Computation 72, 1987.

    Google Scholar 

  5. Larsen, K. and Winskel, G. Using information systems to solve recursive domain equations effectively. In Lecture Notes in Computer Science 173, 1984.

    Google Scholar 

  6. Scott, D.S. Domains for denotational semantics. In Lecture Notes in Computer Science 140, 1982.

    Google Scholar 

  7. Winskel, G. An introduction to event structures. Lecture Notes in Computer Science 354. 1988.

    Google Scholar 

  8. Zhang, G.-Q. DI-domains as prime information systems. Information and Computation 100, 1992. Also in Lecture Notes in Computer Science 372 (ICALP-1989, Italy).

    Google Scholar 

  9. Zhang, G.-Q. Some monoidal closed categories of domains and event structures Mathematical Structures in Computer Science, to appear. Also: Proceedings of the 7th Conference on Mathematical Foundations of Programming Semantics, Pittsburgh, 1991.

    Google Scholar 

  10. Zhang, G.-Q. Logic of Domains. Birkhauser, Boston, 1991.

    Google Scholar 

  11. Zhang, G.-Q. Quasi-prime algebraic domains: a linear category of non-linear functions. To appear. 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of EECS, AI Laboratory, University of Michigan, 48109, Ann Arbor, MI

    Guo-Qiang Zhang

Authors
  1. Guo-Qiang Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Stephen Brookes Michael Main Austin Melton Michael Mislove David Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, GQ. (1994). Universal quasi-prime algebraic domains. In: Brookes, S., Main, M., Melton, A., Mislove, M., Schmidt, D. (eds) Mathematical Foundations of Programming Semantics. MFPS 1993. Lecture Notes in Computer Science, vol 802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58027-1_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-58027-1_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58027-0

  • Online ISBN: 978-3-540-48419-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation