Advertisement

A note on distributive laws and power domains

  • Axel Poigné
Part II Research Contributions Section 1: Semantics
Part of the Lecture Notes in Computer Science book series (LNCS, volume 240)

Keywords

Abelian Group Distributive Lattice Natural Transformation Left Adjoint Forgetful Functor 
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. [Abramsky 83]
    S.Abramsky, On the Semantic Foundations of applicative Multiprogramming, Proc. ICALP'83, LNCS 154, 1983Google Scholar
  2. [ADJ 78]
    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, 1978Google Scholar
  3. [Apt&Plotkin 80]
    K.R.Apt, G.D.Plotkin, A Cook's tour of countable non-determinism, ICALP '81, LNCS 115, Springer Verlag 1981Google Scholar
  4. [Barr&Wells 85]
    M.Barr,C.Wells, Toposes, triples and theories, Springer Verlag 1985Google Scholar
  5. [Beck 69]
    J.Beck, Distributive Laws, LNiMath 80, 1969Google Scholar
  6. [Burstall&Rydeheard]
    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 1985Google Scholar
  7. [Hennessy&Plotkin 79]
    M.C.B.Hennessy, G.D.Plotkin, Full abstraction for a simple parallel programming language, MFCS '79, LNCS 74 Springer Verlag 1979Google Scholar
  8. [Johnstone 82]
    P.T.Johnstone, Stone Spaces, Cambridge University Press 1982Google Scholar
  9. [MacLane 71]
    S.MacLane, Categories for the working mathematician, Springer Verlag 1971Google Scholar
  10. [Manes 76]
    E.Manes, Algebraic theories, Springer Verlag 1976Google Scholar
  11. [Meseguer 79]
    J.Meseguer, Ideal monads and Z-posets, Manuscript Berkeley 1979Google Scholar
  12. [Plotkin 76]
    G.Plotkin, A power domain construction, SIAM J.Comp. 5, 1976Google Scholar
  13. [Plotkin 81]
    G.Plotkin, A power domain for countable non-determinism, in ICALP '82, LNCS 140, Springer Verlag 1982 (also manuscript, Edinburgh 1981)Google Scholar
  14. [Poigné 82]
    A.Poigné, On effective computations of non-deterministic schemes, 5th Int. Symp. on Programming, Turin 1982, LNCS 137, Springer Verlag 1982Google Scholar
  15. [Poigné 83]
    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 1983Google Scholar
  16. [Richter 79]
    G.Richter, Kategorielle Algebra, Akademie Verlag, Berlin 1979Google Scholar
  17. [Scott 76]
    D.S.Scott, Data Types as Lattices, SIAM J. Comp. 5, 1976Google Scholar
  18. [Smyth 78]
    M.B.Smyth, Power Domains, JCSS 16, 1978Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Axel Poigné
    • 1
  1. 1.Dept. of ComputingImperial CollegeLondon

Personalised recommendations