A powerdomain for countable non-determinism

Extended abstract
  • G. D. Plotkin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 140)


Partial Order Operational Semantic Execution Sequence Countable Union Forgetful Functor 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AK]
    Adamek, J. and Koubek, V. Least fixed points of a functor. JCSS, Vol. 19, No. 2, pp. 163–178, (1979).MathSciNetzbMATHGoogle Scholar
  2. [AO]
    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. [AP]
    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. [Bar]
    Barendregt, H.P. The lambda calculus, its syntax and semantics. Studies in Logic, Vol. 103, (1981). Amsterdam: North-Holland.Google Scholar
  5. [HP]
    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. [Kel]
    Keller, R. A fundamental theorem of asynchronous parallel computation in parallel processing, LNCS Vol. 24 (ed. T. Feng) Berlin: Springer-Verlag.Google Scholar
  7. [Kwo]
    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. [LPS]
    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. [Mac]
    MacLane, S. Categories for the Working Mathematician. Berlin: Springer-Verlag, (1971).zbMATHGoogle Scholar
  10. [Man]
    Manna, Z. Logics of programs. Proc. IFIP Congress 1980.Google Scholar
  11. [Mil]
    Milner, R. A calculus of communicating systems. LNCS Vol. 92, (1980) Berlin: Springer-Verlag.Google Scholar
  12. [Par]
    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. [Plo1]
    Plotkin, G.D. A powerdomain construction. SIAM Journal on Computation, Vol. 5, No. 3, pp. 452–487, (1976).MathSciNetCrossRefGoogle Scholar
  14. [Plo2]
    Plotkin, G.D. A structural approach to operational semantics. DAIMI FN-19. Computer Science Department, Aarhus University, (1981).Google Scholar
  15. [Smy]
    Smyth, M.B. Powerdomains. JCSS, Vol. 16, No. 1, (1978).Google Scholar
  16. [SP]
    Smyth, M. and Plotkin, G.D. The categorical solution of recursive domain equations. SIAM Journal on Computation. To appear. (1981).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1982

Authors and Affiliations

  • G. D. Plotkin
    • 1
  1. 1.Dept. of Computer ScienceUniversity of EdinburghScotland

Personalised recommendations