On stable domains
In denotational semantics of programming languages, various categories of domains, with continuous functions as morphisms, and their closure properties under operations like taking products or function space have been intensively studied. However, classes of domains which, like bifinite domains, are also closed under the Plotkin powerdomain operation are rare. The author investigates stable domains. They naturally generalize the concept of \(dI\)-domains studied by Berry and others and satisfy a strong finiteness condition for compact elements, but in general no distributivity assumption. The author shows that the class of all stable domains is closed under countable cartesian products, stable function space and the Plotkin powerdomain operation. As a consequence, he also obtains that the categories of all stable \(L\)-domains and of all distributive stable \(L\)-domains, with stable functions as morphisms, are cartesian closed.
- \(\mathbb{T}^\omega\) as a universal domain
- A Powerdomain Construction
- An algebraic approach to stable domains
- Categories of embeddings
- Data Types as Lattices
- Fully abstract models of typed \(\lambda\)-calculi
- scientific article; zbMATH DE number 3889500 (Why is no real title available?)
- scientific article; zbMATH DE number 4048997 (Why is no real title available?)
- scientific article; zbMATH DE number 4050971 (Why is no real title available?)
- scientific article; zbMATH DE number 3783068 (Why is no real title available?)
- scientific article; zbMATH DE number 48416 (Why is no real title available?)
- scientific article; zbMATH DE number 48157 (Why is no real title available?)
- scientific article; zbMATH DE number 3594646 (Why is no real title available?)
- scientific article; zbMATH DE number 4118557 (Why is no real title available?)
- LCF considered as a programming language
- Non-deterministic information systems and their domains
- The lambda calculus, its syntax and semantics
- The largest Cartesian closed category of domains
- Universal homogeneous event structures and domains
- On Jaffard domains
- Factorisation systems on domains
- On a generalized product for domains
- Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin
- Stable power domains
- Stone duality and representation of stable domain
- A partial solution to an open problem of Amadio and Curien
- Computability on dl-domains
- Maximality and totality of stable functions in the category of stable bifinite domains
- Cartesian closed stable categories
- On the largest Cartesian closed category of stable domains.
- \(\mathbb T^\omega\) as a stable universal domain.
- A stable universal domain related to \(\mathbb{T}^{\omega}\)
- scientific article; zbMATH DE number 517037 (Why is no real title available?)
- scientific article; zbMATH DE number 517038 (Why is no real title available?)
- On connectivity numbers of stable domains
- On the largest Cartesian closed category of stable domains
- scientific article; zbMATH DE number 956831 (Why is no real title available?)
- The largest cartesian closed category of stable domains
- Stable domains are generalized topological spaces
- An algebraic approach to stable domains
- A Nice labelling for tree-like event structures of degree 3
This page was built for publication: On stable domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685428)
