Skip to main content

On semantic foundations for applicative multiprogramming

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1983)

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

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Goguen, J. Thatcher, J. Wagner, E.G. and Wright, J.B. “Initial Algebra Semantics and Continuous Algebras”, JACM (1977).

    Google Scholar 

  2. Apt K. and Plotkin G. “A Cook's tour of Countable Non-determinism”, 8th ICALP, Springer LNCS 115, 1981.

    Google Scholar 

  3. Back, R. “Semantics of Unbounded Non-Determinism”, ICALP '80, Springer LNCS 84, 1980.

    Google Scholar 

  4. Boudol G. “Semantique Operationelle et Algebrique Des Programmes Recursifs Non-Deterministes” These d'Etat, Universite de Paris VII, 1980.

    Google Scholar 

  5. Broy M. “A Fixed Point Theory for Communication and Concurrency”, Munich 1982.

    Google Scholar 

  6. Guessarian I. Algebraic Semantics, Springer LNCS 99, 1981.

    Google Scholar 

  7. Henderson P. “Purely Functional Operating Systems”, in Functional Programming and its Applications, ed. Darlington, Henderson and Turner, Cambridge 1982.

    Google Scholar 

  8. Hennessy M. “Powerdomains and Nondeterministic Recursive Definitions”, Springer LNCS 137, 1982.

    Google Scholar 

  9. Kahn G. “The Semantics of a Simple Language for Parallel Programming”, IFIP Congress 74, 1974.

    Google Scholar 

  10. 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. Lehmann D. “Categories for Fixed Point Semantics”, FOCS 17, also Warwick University Theory of Computation Report, 1976.

    Google Scholar 

  12. Lehmann D. and Smyth M.J. “Algebraic Specification of Abstract Data Types”, Mathematical Systems Theory, 1981.

    Google Scholar 

  13. Nivat M. “Nondeterministic Programs: an Algebraic Overview”, IFIP Congress 80, 1980.

    Google Scholar 

  14. Park D.M.R. “On the Semantics of Fair Parallelism”, Springer LNCS 86, 1980.

    Google Scholar 

  15. Plotkin G.D. “LCF Considered as a Programming Language”, Theoretical Computer Science 1977.

    Google Scholar 

  16. Plotkin G.D. “A Powerdomain Construction”, SIAM Journal on Computing, 1976.

    Google Scholar 

  17. Plotkin G.D. “Dijkstra's Predicate Transformers and Smyth's Powerdomains”, Springer LNCS 86, 1980.

    Google Scholar 

  18. Poigne A. “On Effective Computations of Non-Deterministic Schemes”, Springer LNCS 137, (1982).

    Google Scholar 

  19. Scott D. “An Outline of a Mathematical Theory of Computation”, Oxford 1969.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Josep Diaz

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abramsky, S. (1983). On semantic foundations for applicative multiprogramming. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036893

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12317-0

  • Online ISBN: 978-3-540-40038-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics