Stable power domains
From MaRDI portal
DOI10.1016/0304-3975(93)00121-KzbMATH Open0874.68184MaRDI QIDQ1349652FDOQ1349652
Authors: Reinhold Heckmann 
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Recommendations
lossless power domainssaturated compact setsaturated compact setsstable Plotkin power constructioncompact sets
Semantics in the theory of computing (68Q55) Preorders, orders, domains and lattices (viewed as categories) (18B35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Notions of computation and monads
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Powerdomain Construction
- Title not available (Why is that?)
- Title not available (Why is that?)
- An upper power domain construction in terms of strongly compact sets
- Power domains and second-order predicates
- Title not available (Why is that?)
- Universal profinite domains
- L-domains and lossless powerdomains
Cited In (13)
- Title not available (Why is that?)
- On \(FS_+\)-domains
- On stable domains
- Discrete Lawvere theories and computational effects
- Power domain constructions
- Power stable aggregation functions
- Consistent Hoare powerdomains.
- Consistent Plotkin powerdomains.
- Combining effects: sum and tensor
- L-domains and lossless powerdomains
- The category theoretic understanding of universal algebra: Lawvere theories and monads
- Consistent Smyth powerdomains.
- Basic Operational Preorders for Algebraic Effects in General, and for Combined Probability and Nondeterminism in Particular
This page was built for publication: Stable power domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1349652)
