Advertisement

Experiments, powerdomains and fully abstract models for applicative multiprogramming

  • Samson Abramsky
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 158)

Keywords

Closure Operator Transition Relation Operational Semantic Denotational Semantic Springer LNCS 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Abr82]
    Abramsky, S. "On Semantic Foundations for Applicative Multiprogramming", To appear in ICALP '83, Also QMC CSL Report Number 321, 1982.Google Scholar
  2. [AP80]
    Apt, K. and Plotkin, G.D. "Countable Non-determinism and Random Assignment" Technical Report, Edinburgh University, 1982.Google Scholar
  3. [ADJ78]
    Goguen, J. Thatcher, J. Wagner, E.G. and Wright, J.B. "Initial Algebra Semantics and Continuous Algebras", JACM (1977).Google Scholar
  4. [Bro82]
    Broy, M. "Fixed Point Theory for Communication and Concurrency", Technical University of Munich, 1982.Google Scholar
  5. [DeNH82]
    DeNicola, R. and Hennessy, M. "Testing Equivalences for Processes", Technical Report CSR-123-82, Edinburgh University, 1982.Google Scholar
  6. [Gue]
    Guessarian I. Algebraic Semantics, Springer LNCS 99, 1981.Google Scholar
  7. [Hen81]
    Hennessy M. "Powerdomains and Nondeterministic Recursive Definitions", Springer LNCS 137, 1982.Google Scholar
  8. [Kah74]
    Kahn G. "The Semantics of a Simple Language for Parallel Programming", IFIP Congress 74, 1974.Google Scholar
  9. [KH80]
    Kennaway, J.K. and Hoare, C.A.R. "A Theory of Nondeterminism", ICALP 80, Springer LNCS 85, 1980.Google Scholar
  10. [Mil73]
    Milner R. "Processes: A Mathematical Model for Computing Agents", in Logic Colloquium '73, ed. Rose H.E. and Shepherdson J.C., North Holland 1975.Google Scholar
  11. [Mil80]
    Milner R. A Calculus of Communicating Systems, Springer LNCS 92, 1980.Google Scholar
  12. [Niv79]
    Nivat, M. "Infinite words, infinite trees, infinite computations", in Foundations of Computer Science III Part 2, ed. de Bakker and van Leeuwen, Mathematical Centre Tracts 109, Amsterdam 1979.Google Scholar
  13. [Niv80]
    Nivat M. "Nondeterministic Programs: an Algebraic Overview", IFIP Congress 80, 1980.Google Scholar
  14. [Plo76]
    Plotkin G.D. "A Powerdomain Construction", SIAM Journal on Computing 1976.Google Scholar
  15. [Plo77]
    Plotkin G.D. "LCF Considered as a Programming Language", Theoretical Computer Science 1977.Google Scholar
  16. [Plo82]
    Plotkin G.D. "An Operational Semantics for CSP", Technical Report, Edinburgh University, 1982.Google Scholar
  17. [Smy78]
    Smyth M.J. "Powerdomains", JCSS 1978.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Samson Abramsky
    • 1
  1. 1.Department of Computer Science and StatisticsQueen Mary CollegeLondon

Personalised recommendations