Applications of compactness in the Smyth powerdomain of streams

  • J. -J. Ch. Meyer
  • E. P. de Vink
Session CAAP 6 Foundations
Part of the Lecture Notes in Computer Science book series (LNCS, volume 249)


We show in a uniform setting the crucial role of compactness in the theory of the Smyth powerdomain of streams. The topological notion of compactness is characterized in an order-theoretical manner, involving a notion of bounded sets. We obtain general results on the continuity of operators, and consider applications as diverse as interleaving, hiding and stream programming operators.


Logic Program Logic Programming Atomic Action Power Domain Stream Programming 
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.

Section 7 References

  1. [Ba].
    R.J.R. Back, “A Continuous Semantics for Unbounded Nondeterminism,” Theoretical Computer Science 23, pp. 187–210 (1983).CrossRefGoogle Scholar
  2. [dB].
    J.W. de Bakker, Mathematical Theory of Program Correctness, Prentice-Hall (1980).Google Scholar
  3. [BBKM].
    J.W. de Bakker, J.A. Bergstra, J.W. Klop, and J.-J.Ch. Meyer, “Linear Time and Branching Time Semantics for Recursion with Merge,” Theoretical Computer Science 34, pp. 135–156 (1984).CrossRefGoogle Scholar
  4. [dBK].
    J.W. de Bakker and J.N. Kok, “Towards a Uniform Topological Treatment of Streams and Functions on Streams,” Proceedings of the 12th ICALP, pp. 140–148, Springer, LNCS 194 (1985).Google Scholar
  5. [BKMOZ].
    J.W. de Bakker, J.N. Kok, J.-J.Ch. Meyer, E.-R. Olderog and J.I. Zucker, “Contrasting Themes in the Semantics of Imperative Concurrency,” in Current Trends in Concurrency: Overviews and Tutorials, pp. 51–121, Springer, LNCS 224 (1986).Google Scholar
  6. [BMO].
    J.W. de Bakker, J.-J.Ch. Meyer, and E.-R. Olderog, “Infinite Streams and Finite Observations in the Semantics of Uniform Concurrency,” Proceedings of the 12th ICALP, pp. 149–157, Springer, LNCS 194 (1985).Google Scholar
  7. [BZ].
    J.W. de Bakker and J.I. Zucker, “Compactnes in Semantics for Merge and Fair Merge,” Proceedings Workshop Logics of Programs, Pittsburgh, pp. 18–33, Springer, LNCS 154 (1983).Google Scholar
  8. [BK].
    J.A. Bergstra and J.W. Klop, “Process Algebra for Synchronous Communication,” Information and Control 60, pp. 109–137 (1984).CrossRefGoogle Scholar
  9. [Br1].
    M. Broy, “Fixed Point Theory for Communication and Concurrency,” Proceedings of the IFIP TC2 Working Conference '82, Garmisch-Partenkirchen, North-Holland (1983).Google Scholar
  10. [Br2].
    M. Broy, “Extensional Behaviour of Concurrent, Nondetermininstic, Communicating Systems,” pp. 229–276 in Control Flow and Data Flow: Concepts of Distributed Programming, ed. M. Broy, Springer (1985).Google Scholar
  11. [Bu].
    W.H. Burge, “Stream Processing Functions,” IBM Journal of Research and Development 19, pp. 12–25 (1975).Google Scholar
  12. [Du].
    J. Dugundji, Topology, Allyn and Bacon (1966).Google Scholar
  13. [En].
    R. Engelking, General Topology, Polish Scientific Publishers (1977).Google Scholar
  14. [JM].
    N.D. Jones and A. Mycroft, “Stepwise Development of Operational and Denotational Semantics for Prolog,” 1984 International Symposium on Logic Programming, Atlantic City, pp. 281–288 (1984).Google Scholar
  15. [Ku].
    R. Kuiper, “An Operational Semantics for Bounded Nondeterminism Equivalent to a Denotaional One,” IFIP TC2-MC Symposium on Algorithmic Languages, Amsterdam, pp. 373–398, North-Holland (1981).Google Scholar
  16. [Ll].
    J.W. Lloyd, Foundations of Logic Programming, Springer (1984).Google Scholar
  17. [Ma].
    M. Maine, “Demons, Chaos and Communicating Processes: A Model Theory for Milner's CCS in Terms of Smyth Powerdomains,” Proceedings of the Workshop on Mathematical Foundations of Programming Semantics (1986).Google Scholar
  18. [Me1].
    J.-J.Ch. Meyer, Programming Calculi Based on Fixed Point Transformations: Semantics and Applications, Free University, Dissertation, Amsterdam (1985).Google Scholar
  19. [Me2].
    J.-J.Ch. Meyer, “Merging Regular Processes by Means of Fixed Point Theory,” Theoretical Computer Science, to appear.Google Scholar
  20. [MO].
    J.-J.Ch. Meyer and E.-R. Olderog, “Hiding in Stream Semantics of Uniform Concurrency,” Technical Report, Free University, Amsterdam. In preparation.Google Scholar
  21. [MV].
    J.-J.Ch. Meyer and E.P. de Vink, “Applications of Compactness in the Smyth Powerdomain of Streams,” Technical Report IR-110, Free University, Amsterdam (1986).Google Scholar
  22. [Mi].
    R. Milner, A Calculus for Communicating Processes, Springer, LNCS 92 (1980).Google Scholar
  23. [NA].
    M.A. Nait Abdallah, “On the Interpretation of Infinite Computations in Logic Programming,” Proceedings of the 11th International Colloqium on Automata Languages and Programming, Antwerp, pp. 358–370, Springer, LNCS 172 (1984).Google Scholar
  24. [Ni].
    M. Nivat, “Infinite Words, Infinite Trees, Infinite Computations,” pp. 1–52 in Foundations of Computer Science III, ed. J.W. de Bakker & J. van Leeuwen, Mathematical Centre, Amsterdam (1979).Google Scholar
  25. [OH].
    E.-R. Olderog and C.A.R. Hoare, “Specificaton-Oriented Semantics for Communicating Processes,” Acta Informatica 23, pp. 9–66 (1986).Google Scholar
  26. [Pl].
    G.D. Plotkin, “A Power Domain Construction,” SIAM Journal on Computing 5, pp. 452–487 (1976).CrossRefGoogle Scholar
  27. [Sm1].
    M.B. Smyth, “Power Domains,” Journal of Computer and System Sciences 16, pp. 23–36 (1978).CrossRefGoogle Scholar
  28. [Sm2].
    M.B. Smyth, “Power Domains and Predicate Transformers: A Topological View,” Proceeding of the 10th ICALP, pp. 662–675, Springer, LNCS 154 (1983).Google Scholar
  29. [Tu].
    D.A. Turner, “Recursion Equations as a Programming Language,” pp. 1–28 in Functional Programming and Its Applications, ed. J. Darlington, P. Henderson & D.A. Turner, Cambridge University Press (1982).Google Scholar
  30. [dV].
    E.P. de Vink, “Stream Semantics for Infinite Logic Programming,” Technical Report, Free University, Amsterdam. In preparation.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • J. -J. Ch. Meyer
    • 1
  • E. P. de Vink
    • 1
  1. 1.Department of Mathematics and Computer ScienceFree University AmsterdamThe Netherlands

Personalised recommendations