[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

DI-domains as information systems

Extended abstract

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1989)

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

Included in the following conference series:

  • 145 Accesses

Abstract

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.

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. Berry, G., Stable models of typed λ-calculi, LNCS 62 (1978)

    Google Scholar 

  2. Girard, Jean-Yves, Linear logic, Theoretical Computer Science 50 (1987)

    Google Scholar 

  3. Kahn, G., Plotkin, G., Domaines concretes, Rapport INRIA Laboria No. 336 (1978)

    Google Scholar 

  4. Larsen, K., Winskel, G., Using information systems to solve recursive domain equations effectively, LNCS 173 (1984)

    Google Scholar 

  5. Maclane, S., Categories for the working mathematician, Springer-Verlag (1971)

    Google Scholar 

  6. Nielsen, M., Plotkin, G., Winskel, G., Petri nets, event structures and domains, pert 1, Theoretical Computer Science 13 (1981)

    Google Scholar 

  7. Scott, D. S., Domains for denotational semantics, LNCS 140 (1982)

    Google Scholar 

  8. Winskel, G., Event structures, LNCS 255 (1986)

    Google Scholar 

  9. Winskel, G., Event structures, Rex-summer school: Research and Education in Concurrency, Holland (1988)

    Google Scholar 

  10. Zhang, G. Q., DI-domains as Informations systems, Technical Report of Computer Science Department, Aarhus University, Denmark (1989)

    Google Scholar 

  11. Zhang, G. Q., Logics of Domains, PhD thesis, University of Cambridge (1989)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Aarhus University, Ny Munkegade 116, 8000, Aarhus, Denmark

    Guo Qiang Zhang

Authors
  1. Guo Qiang Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Giorgio Ausiello Mariangiola Dezani-Ciancaglini Simonetta Ronchi Della Rocca

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, G.Q. (1989). DI-domains as information systems. In: Ausiello, G., Dezani-Ciancaglini, M., Della Rocca, S.R. (eds) Automata, Languages and Programming. ICALP 1989. Lecture Notes in Computer Science, vol 372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0035798

Download citation

  • DOI: https://doi.org/10.1007/BFb0035798

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51371-1

  • Online ISBN: 978-3-540-46201-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation