Abstract and concrete categories
Abstract and concrete categories
Handbook of theoretical computer science (vol. B)
Mathematical theory of domains
Mathematical theory of domains
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
On Semantic Foundations for Applicative Multiprogramming
Proceedings of the 10th Colloquium on Automata, Languages and Programming
A categorical generalization of Scott domains
Mathematical Structures in Computer Science
The Bicategory-Theoretic Solution of Recursive Domain Equations
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.00 |
Scott domains, originated and commonly used in formal semantics of computer languages, were generalized by J. Adámek to Scott complete categories. We prove that the categorical counterpart of the result of D. Scott – the existence of a countable based Scott domain universal with respect to all countably based Scott domains – is no longer valid for the categorical generalization. However, all obstacles disappear if the notion of the Scott complete category is weakened to a categorical counterpart of bifinite domains.