Advertisement

On semantic foundations for applicative multiprogramming

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

Keywords

Operational Semantic Program Scheme Small Category Terminal Object Predicate Transformer 
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. [ADJ]
    Goguen, J. Thatcher, J. Wagner, E.G. and Wright, J.B. “Initial Algebra Semantics and Continuous Algebras”, JACM (1977).Google Scholar
  2. [AP]
    Apt K. and Plotkin G. “A Cook's tour of Countable Non-determinism”, 8th ICALP, Springer LNCS 115, 1981.Google Scholar
  3. [Bac]
    Back, R. “Semantics of Unbounded Non-Determinism”, ICALP '80, Springer LNCS 84, 1980.Google Scholar
  4. [Bou]
    Boudol G. “Semantique Operationelle et Algebrique Des Programmes Recursifs Non-Deterministes” These d'Etat, Universite de Paris VII, 1980.Google Scholar
  5. [Bro]
    Broy M. “A Fixed Point Theory for Communication and Concurrency”, Munich 1982.Google Scholar
  6. [Gue]
    Guessarian I. Algebraic Semantics, Springer LNCS 99, 1981.Google Scholar
  7. [Hend82]
    Henderson P. “Purely Functional Operating Systems”, in Functional Programming and its Applications, ed. Darlington, Henderson and Turner, Cambridge 1982.Google Scholar
  8. [Henn81]
    Hennessy M. “Powerdomains and Nondeterministic Recursive Definitions”, Springer LNCS 137, 1982.Google Scholar
  9. [Kah74]
    Kahn G. “The Semantics of a Simple Language for Parallel Programming”, IFIP Congress 74, 1974.Google Scholar
  10. [Kel]
    Keller R.M. “Denotational Models for Parallel Programs with Indeterminate Operators”, in Formal Description of Programming Concepts ed. Neuhold, North Holland 1978.Google Scholar
  11. [Leh76]
    Lehmann D. “Categories for Fixed Point Semantics”, FOCS 17, also Warwick University Theory of Computation Report, 1976.Google Scholar
  12. [LS81]
    Lehmann D. and Smyth M.J. “Algebraic Specification of Abstract Data Types”, Mathematical Systems Theory, 1981.Google Scholar
  13. [Niv]
    Nivat M. “Nondeterministic Programs: an Algebraic Overview”, IFIP Congress 80, 1980.Google Scholar
  14. [Par]
    Park D.M.R. “On the Semantics of Fair Parallelism”, Springer LNCS 86, 1980.Google Scholar
  15. [Plo75]
    Plotkin G.D. “LCF Considered as a Programming Language”, Theoretical Computer Science 1977.Google Scholar
  16. [Plo76]
    Plotkin G.D. “A Powerdomain Construction”, SIAM Journal on Computing, 1976.Google Scholar
  17. [Plo80]
    Plotkin G.D. “Dijkstra's Predicate Transformers and Smyth's Powerdomains”, Springer LNCS 86, 1980.Google Scholar
  18. [Poi]
    Poigne A. “On Effective Computations of Non-Deterministic Schemes”, Springer LNCS 137, (1982).Google Scholar
  19. [Sco69]
    Scott D. “An Outline of a Mathematical Theory of Computation”, Oxford 1969.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

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

Personalised recommendations