Skip to main content
SpringerLink
Log in

A simple language supporting angelic nondeterminism and parallel composition

  • Conference paper
  • First Online:
Book cover Mathematical Foundations of Programming Semantics (MFPS 1991)

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

Work partially supported by the Office of Naval Research and the Louisiana State Board of Regents

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. Abramsky, S. Domain theory in logical form, Annals of Pure and Applied Logic 51 (1991), pp.1–77.

    Article  Google Scholar 

  2. Barendregt, H. P. The Lambda Calculus, North-Holland Publishers (1981).

    Google Scholar 

  3. Gierz, G., et al. A Compendium of Continuous Lattices, Springer-Verlag (1981).

    Google Scholar 

  4. Dershowitz, N. and J.-P. Jouannaud, Rewrite Systems, in: Handbook of Theoretical Computer Science, Volume B, Formal Methods and Semantics. The MIT Press / Elsevier (Cambridge, Mass. / Amsterdam) (1990), pp.243–320.

    Google Scholar 

  5. Hennessy, M. and G. Plotkin. Full abstraction for a simple parallel programming language, Lecture Notes in Computer Science 74 (1979), Spinger-Verlag.

    Google Scholar 

  6. Jung, Achim. Cartesian closed categories of domains, Ph. D. Thesis, Technische Hochschule Darmstadt, 1988.

    Google Scholar 

  7. Mislove, M. W. When are order scattered and topologically scattered the same?, Annals of Discrete Mathematics 23 (1982), pp. 61–80.

    Google Scholar 

  8. Mislove, M. W. Algebraic posets, algebraic cpo 's and models of concurrency, Proceedings of the Oxford Symposium on Topology, Oxford University Press (1991), to appear.

    Google Scholar 

  9. Mislove, M. W. and F. J. Oles, A Topological Algebra for Angelic Nondeterminism, IBM Research Report RC 17344 (#76620), submitted for publication.

    Google Scholar 

  10. Oles, F. J. The semantics of concurrency without powerdomains, Proceedings of the 14th ACM Symposium on the Principles of Programming Languages, ACM Press (1987).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Tulane University, 70118, New Orleans, LA

    Michael W. Mislove

  2. Mathematical Sciences Department, IBM Thomas J. Watson Research Center, 10598, Yorktown Heights, NY

    Prank J. Oles

Authors
  1. Michael W. Mislove
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Prank J. Oles
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Stephen Brookes Michael Main Austin Melton Michael Mislove David Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mislove, M.W., Oles, P.J. (1992). A simple language supporting angelic nondeterminism and parallel composition. In: Brookes, S., Main, M., Melton, A., Mislove, M., Schmidt, D. (eds) Mathematical Foundations of Programming Semantics. MFPS 1991. Lecture Notes in Computer Science, vol 598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55511-0_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-55511-0_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55511-7

  • Online ISBN: 978-3-540-47194-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation