Skip to main content
SpringerLink
Log in

Full abstraction for a simple parallel programming language

  • Invited Lectures
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1979 (MFCS 1979)

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brinch Hansen, P. (1978), Distributed Processes: A Concurrent Programming Concept. Comm. ACM 21, 11, pp. 934–940.

    Article  Google Scholar 

  2. Egli, H. (1975): A Mathematical Model for Nondeterministic Computation.

    Google Scholar 

  3. Hennessy, M.C.B. and Ashcroft, E.A. (1979): A Mathematical Semantics for a Nondeterministic Typed λ-calculus. To appear.

    Google Scholar 

  4. Hoare, C.A.R. (1978): Communicating Sequential Processes. Comm. ACM 21, 8, pp. 666–677.

    Article  Google Scholar 

  5. Mac Lane, S. (1971): Categories for the Working Mathematician. Berlin, Springer Verlag.

    Google Scholar 

  6. Milne, G.J. and Milner, R. (1977): Concurrent processes and their syntax. To appear in the J.A.C.M.

    Google Scholar 

  7. Milner, R. (1977): Fully Abstract Models of Typed λ-calculi. T.C.S.

    Google Scholar 

  8. Plotkin, G.D. (1976): A Powerdomain Construction. SIAM Journal on Computing 5, 3, pp. 452–487.

    Article  Google Scholar 

  9. Plotkin, G.D. (1977): LCF Considered as a Programming Language. T.C.S. 5, pp. 223–255.

    Article  Google Scholar 

  10. Smyth, M. (1978): Powerdomains. J.C.S.S. 16, 1.

    Google Scholar 

  11. Smyth, M. and Plotkin, G.D. (1978): The Category Theoretic Solution of Recursive Domain Equations. University of Edinburgh: D.A.I. Research Report No 60.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Artificial Intelligence, University of Edinburgh, Hope Park Square Meadow Lane, EH8 9NW, Edinburgh, Scotland

    M. C. B. Hennessy & G. D. Plotkin

Authors
  1. M. C. B. Hennessy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. D. Plotkin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jiří Bečvář

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hennessy, M.C.B., Plotkin, G.D. (1979). Full abstraction for a simple parallel programming language. In: Bečvář, J. (eds) Mathematical Foundations of Computer Science 1979. MFCS 1979. Lecture Notes in Computer Science, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09526-8_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-09526-8_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09526-2

  • Online ISBN: 978-3-540-35088-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation