Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1982: Automata, Languages and Programming pp 418–428Cite as

A powerdomain for countable non-determinism

Extended abstract

  • Conference paper
  • First Online:

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

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adamek, J. and Koubek, V. Least fixed points of a functor. JCSS, Vol. 19, No. 2, pp. 163–178, (1979).

    MathSciNet  MATH  Google Scholar 

  2. Apt, K.R. and Olderog, E.-R. Proof rules dealing with fairness. Bericht Nr. 8104, Institut für Informatik und Praktische Mathematik, Kat. Christian-Albrechts Universität, (1981).

    Google Scholar 

  3. Apt, K.R. and Plotkin, G.D. A Cook's tour of countable non-determinism. Proc. ICALP 1981. LNCS Vol. 115 (eds. S. Even and O. Kariv). Berlin: Springer-Verlag, pp. 479–494, (1981).

    Google Scholar 

  4. Barendregt, H.P. The lambda calculus, its syntax and semantics. Studies in Logic, Vol. 103, (1981). Amsterdam: North-Holland.

    Google Scholar 

  5. Hennessy, M.C.B. and Plotkin, G.D. Full abstraction for a simple parallel programming language. Proc. MFCS, LNCS Vol. 74, pp. 108–120 (ed. Becvar,J.) (1979), Berlin: Springer-Verlag.

    Google Scholar 

  6. Keller, R. A fundamental theorem of asynchronous parallel computation in parallel processing, LNCS Vol. 24 (ed. T. Feng) Berlin: Springer-Verlag.

    Google Scholar 

  7. Kwong, Y.S. On the absence of livelock in parallel programs. Semantics of concurrent computation, LNCS Vol. 70, pp. 172–190 (ed. G. Kahn) Berlin: Springer-Verlag, (1979).

    Google Scholar 

  8. Lehmann, D., Pnueli, A. and Stavi, J. Impartiality, justice and fairness: the ethics of concurrent termination. Proc. ICALP 1981, LNCS Vol. 115 (eds. S. Even and O. Kariv) Berlin: Springer-Verlag, pp. 264–277, (1981).

    Google Scholar 

  9. MacLane, S. Categories for the Working Mathematician. Berlin: Springer-Verlag, (1971).

    MATH  Google Scholar 

  10. Manna, Z. Logics of programs. Proc. IFIP Congress 1980.

    Google Scholar 

  11. Milner, R. A calculus of communicating systems. LNCS Vol. 92, (1980) Berlin: Springer-Verlag.

    Google Scholar 

  12. Park, D. A predicate transformer for weak fair iteration. Proc. 6th IBM Symposium on Mathematical Foundations of Computer Science, Hakone, Japan, (1981).

    Google Scholar 

  13. Plotkin, G.D. A powerdomain construction. SIAM Journal on Computation, Vol. 5, No. 3, pp. 452–487, (1976).

    Article  MathSciNet  Google Scholar 

  14. Plotkin, G.D. A structural approach to operational semantics. DAIMI FN-19. Computer Science Department, Aarhus University, (1981).

    Google Scholar 

  15. Smyth, M.B. Powerdomains. JCSS, Vol. 16, No. 1, (1978).

    Google Scholar 

  16. Smyth, M. and Plotkin, G.D. The categorical solution of recursive domain equations. SIAM Journal on Computation. To appear. (1981).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Edinburgh, Scotland

    G. D. Plotkin

Authors
  1. G. D. Plotkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mogens Nielsen Erik Meineche Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Plotkin, G.D. (1982). A powerdomain for countable non-determinism. In: Nielsen, M., Schmidt, E.M. (eds) Automata, Languages and Programming. ICALP 1982. Lecture Notes in Computer Science, vol 140. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0012788

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11576-2

  • Online ISBN: 978-3-540-39308-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation