Skip to main content
SpringerLink
Log in

A note on distributive laws and power domains

  • Part II Research Contributions
  • Chapter
  • First Online:
Category Theory and Computer Programming

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

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. S.Abramsky, On the Semantic Foundations of applicative Multiprogramming, Proc. ICALP'83, LNCS 154, 1983

    Google Scholar 

  2. ADJ (= J.A.Goguen,J.W.Thatcher,E.G.Wagner,J.B.Wright) A uniform approach to inductive posets and inductive closure, in MFCS'78 (J.Gruska, ed.), LNCS 53, Springer Verlag 1977, also in TCS 7, 1978

    Google Scholar 

  3. K.R.Apt, G.D.Plotkin, A Cook's tour of countable non-determinism, ICALP '81, LNCS 115, Springer Verlag 1981

    Google Scholar 

  4. M.Barr,C.Wells, Toposes, triples and theories, Springer Verlag 1985

    Google Scholar 

  5. J.Beck, Distributive Laws, LNiMath 80, 1969

    Google Scholar 

  6. D.E.Rydeheard, R.M.Burstall, Monads and Theories — a Survey for Computation, In: Algebraic Methods in Semantics, eds. Nivat and Reynolds, Cambridge University Press 1985

    Google Scholar 

  7. M.C.B.Hennessy, G.D.Plotkin, Full abstraction for a simple parallel programming language, MFCS '79, LNCS 74 Springer Verlag 1979

    Google Scholar 

  8. P.T.Johnstone, Stone Spaces, Cambridge University Press 1982

    Google Scholar 

  9. S.MacLane, Categories for the working mathematician, Springer Verlag 1971

    Google Scholar 

  10. E.Manes, Algebraic theories, Springer Verlag 1976

    Google Scholar 

  11. J.Meseguer, Ideal monads and Z-posets, Manuscript Berkeley 1979

    Google Scholar 

  12. G.Plotkin, A power domain construction, SIAM J.Comp. 5, 1976

    Google Scholar 

  13. G.Plotkin, A power domain for countable non-determinism, in ICALP '82, LNCS 140, Springer Verlag 1982 (also manuscript, Edinburgh 1981)

    Google Scholar 

  14. A.Poigné, On effective computations of non-deterministic schemes, 5th Int. Symp. on Programming, Turin 1982, LNCS 137, Springer Verlag 1982

    Google Scholar 

  15. A.Poigné, On algebras of computation sequences and proofs of equivalence of operational and denotational semantics, 6th GI Conf. theor. Comp. Sci., Dortmund 1983, LNCS 145, Springer Verlag 1983

    Google Scholar 

  16. G.Richter, Kategorielle Algebra, Akademie Verlag, Berlin 1979

    Google Scholar 

  17. D.S.Scott, Data Types as Lattices, SIAM J. Comp. 5, 1976

    Google Scholar 

  18. M.B.Smyth, Power Domains, JCSS 16, 1978

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computing, Imperial College, SW7 2BZ, London

    Axel Poigné

Authors
  1. Axel Poigné
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

David Pitt Samson Abramsky Axel Poigné David Rydeheard

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Poigné, A. (1986). A note on distributive laws and power domains. In: Pitt, D., Abramsky, S., Poigné, A., Rydeheard, D. (eds) Category Theory and Computer Programming. Lecture Notes in Computer Science, vol 240. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17162-2_127

Download citation

  • DOI: https://doi.org/10.1007/3-540-17162-2_127

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17162-1

  • Online ISBN: 978-3-540-47213-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation