New results on hierarchies of domains

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The relation between a cpo D and its space [D → D] of Scott-continuous functions is investigated. For a cpo D with a least element we show that if [D → D] is algebraic then D itself is algebraic. Together with a generalization of Smyth's Theorem to strict functions this implies that [D → D] is ω-algebraic whenever (Formula presented.) is. It is an open question, whether [D → D] is ω-algebraic whenever (Formula presented.) is algebraic. Smyth's Theorem is extended to the class of cpo's with no least element assumed. Our main result asserts that in this context the profinites again form the largest cartesian closed category of domains. The proof also yields the following: if the functionspace of a cpo D is algebraic, then D has infima for filtered sets. The question, whether an ω-algebraic functionspace implies that D is profinite, remains open.

Cite

CITATION STYLE

APA

Jung, A. (1988). New results on hierarchies of domains. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 298 LNCS, pp. 303–310). Springer Verlag. https://doi.org/10.1007/3-540-19020-1_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free